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

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

Detalhes bibliográficos
Publicado no:Philippine computing journal 7, 1 (2012(Ag)).
Autor principal: Vergara, John Paul C.
Formato: Artigo
Idioma:English
Assuntos:
Non-deterministic polynomial time.
Polynomial time.
Cook's Theorem.