Recognizing disguised NR(1) instances of the satisfiability problem

Journal of Algorithms - Tập 1 - Trang 97-103 - 1980
Bengt Aspvall1
1Computer Science Department, Stanford University, Stanford, California 94305 USA

Tài liệu tham khảo

Aho, 1974 Aspvall, 1979, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, 8, 121 1978, 93 1978, 198 Cook, 1971, The complexity of theorem proving procedures, 151 Garey, 1979 Koehler, 1975 Reingold, 1977 Schaefer, 1978, The complexity of satisfiability problems, 216
Thông tin
Thông tin xuất bản

Journal of Algorithms

Tập 1

97-103

Thông tin tác giả