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

Dettagli Bibliografici
Autore principale:	Vergara, John Paul C.
Natura:	Analytics
Lingua:	English
Soggetti:	Computer-Periodicals. Non-deterministic turing machine computation. Turing-computable function. Satisfiability.