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

Détails bibliographiques
Publié dans:	Philippine computing journal 7, 1 (2012(Ag)).
Auteur principal:	Vergara, John Paul C.
Format:	Article
Langue:	anglais
Sujets:	Non-deterministic polynomial time. Polynomial time. Cook's Theorem.