Satisfied with satisfiability? - a note on the first NP-complete proglem. [article].

Dades bibliogràfiques
Autor principal:	Vergara, John Paul C.
Format:	Analytics
Idioma:	English
Matèries:	Computer-Periodicals. Non-deterministic turing machine computation. Turing-computable function. Satisfiability.