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

書誌詳細
第一著者:	Vergara, John Paul C.
フォーマット:	Analytics
言語:	English
主題:	Computer-Periodicals. Non-deterministic turing machine computation. Turing-computable function. Satisfiability.