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

Opis bibliograficzny
1. autor:	Vergara, John Paul C.
Format:	Analytics
Język:	English
Hasła przedmiotowe:	Computer-Periodicals. Non-deterministic turing machine computation. Turing-computable function. Satisfiability.