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

Xehetasun bibliografikoak
Egile nagusia:	Vergara, John Paul C.
Formatua:	Analytics
Hizkuntza:	English
Gaiak:	Computer-Periodicals. Non-deterministic turing machine computation. Turing-computable function. Satisfiability.