The complexity of the Hajós calculus for planar graphs

Authors:
Kazuo Iwama;Kazuhisa Seto;Suguru Tamaki
Affiliations:
Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan;Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan;Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan
Venue:
Theoretical Computer Science
Year:
2010

Citing 10
Cited 0

Exponential lower bounds for the pigeonhole principle

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The Complexity of the Hajos Calculus

SIAM Journal on Discrete Mathematics
Exponential lower bounds for the tree-like Hajo´s calculus

Information Processing Letters
Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
Linear gaps between degrees for the polynomial calculus modulo distinct primes

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
An approximation scheme for planar graph TSP

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Lower bounds for k-DNF resolution on random 3-CNFs

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Towards an optimal separation of space and length in resolution

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

The planar Hajos calculus is the Hajos calculus with the restriction that all the graphs that appear in the construction (including a final graph) must be planar. We prove that the planar Hajos calculus is polynomially bounded iff the Hajos calculus is polynomially bounded.