Proof that Boolean satisfiability problem is NP-complete

From Wikipedia, the free encyclopedia
Revision as of 15:01, 19 January 2008 by imported>Gdr (Undid revision 178636878 by Mikkalai (talk))
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Redirect page
Jump to navigation Jump to search

Redirect to:

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Proof_that_Boolean_satisfiability_problem_is_NP-complete&oldid=2511761"