论文信息 - The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness - 字舞流文

The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] A. K. Dewdney. Linear time transformations between combinatorial problems , 1982 .

[5] C. Ward Henson,et al. A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories , 1990, Ann. Pure Appl. Log..

[6] Etienne Grandjean,et al. A Nontrivial Lower Bound for an NP Problem on Automata , 1990, SIAM J. Comput..

[7] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.