S. A. Cook, The complexity of theor em-pr oving pr3 ur es, In Proc. of 3rd Ann. ACM Symp. on Theory of Computing, (1971) 151--158. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Analog Algorithm for Satisfiability Problem - Takenaka, Hashimoto (2002) (Correct)
....and Mathematical Science, Graduate School of Engineering Science, Osaka University Machikaneyama 1 3, Toyonaka, Osaka 560 8531, Japan, takenaka,hashimoto ics.es.osaka u. ac.jp 1 Introduction Thesatisfiabil0 yprobl9 (SAT)hol0 the honor of being the first NP compl2W problm in Cook s theorem[2] and it isstil one of the most important NPcompl08 probl892W ] Manyprobl62 in variousfielu can be naturalW encoded into SAT and then sol ed by a SAT sol er. In fact, someprobl0H are reported to besol ed more e#cientl by a SAT sol er than by the specialBH2 alalBH2 [3, 4] With growing interest in ....
S. A. Cook, The complexity of theor em-pr oving pr3 ur es, In Proc. of 3rd Ann. ACM Symp. on Theory of Computing, (1971) 151--158.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC