Satisfied with Satisfiability-A Note on the First NP-complete Problem

Dettagli Bibliografici
Pubblicato in:	Philippine computing journal 7, 1 (2012(Ag)).
Autore principale:	Vergara, John Paul C.
Natura:	Articolo
Lingua:	English
Soggetti:	Non-deterministic polynomial time. Polynomial time. Cook's Theorem.