论文信息 - Exponential Lower Bounds for the Tree-Like Hajós Calculus

Exponential Lower Bounds for the Tree-Like Hajós Calculus

The Hajos Calculus is a simple, nondeterministic procedure which generates precisely the class of non-3-colorable graphs. In this note, we prove exponential lower bounds on the size of tree-like Hajos constructions.

Toniann Pitassi | Kazuo Iwama

[1] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[2] Alasdair Urquhart,et al. Complexity of Proofs in Classical Propositional Logic , 1992 .

[3] Russell Impagliazzo,et al. Exponential lower bounds for the pigeonhole principle , 1992, STOC '92.

[4] Jan Krajícek,et al. Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.

[5] David S. Johnson,et al. Stockmeyer: some simplified np-complete graph problems , 1976 .

[6] Toniann Pitassi,et al. The complexity of the Hajos calculus , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[7] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..