-1
$\begingroup$

Given a prime $p$ and an NTM with number of accepting paths $g$, is it possible to construct an NTM with number of accepting paths $g\bmod p$ in polynomial time where by $g\bmod p$ I mean the reprsentative of $g\bmod p$ in $[0,p-1]$ after (possibly assuming) the strong assumption $PP\subseteq Mod_kP$ at every prime $k$?

$\endgroup$

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.