The Complexity of the Haj6s Calculus
暂无分享,去创建一个
[1] Stephen A. Cook,et al. Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.
[2] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[3] Jan Krajícek,et al. Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.
[4] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[5] Jan Krajícek,et al. Propositional proof systems, the consistency of first order theories and the complexity of computations , 1989, Journal of Symbolic Logic.
[6] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .