The complexity of satisfiability problems
暂无分享,去创建一个
[1] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .
[2] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[3] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[4] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[5] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.
[6] M. Paterson,et al. A note on disjunctive form tautologies , 1973, SIGA.
[7] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.
[8] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..
[9] Thomas J. Schaefer,et al. Complexity of decision problems based on finite two-person perfect-information games , 1976, STOC '76.
[10] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..