Every language in co-NP can be reduced in polynomial-time to an instance of [itex]\forall x P(x)[/itex] for some Boolean formula with a single bound variable and no free variables, right?
via Physics Forums RSS Feed http://www.physicsforums.com/showthread.php?t=703915&goto=newpost
0 commentaires:
Enregistrer un commentaire