Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses

Authors:
Adam R. Klivans;Dieter van Melkebeek
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2002

Citing 0
Cited 33

The size of SPP

Theoretical Computer Science
Simple extractors for all min-entropies and a new pseudorandom generator

Journal of the ACM (JACM)
Beyond NP: the work and legacy of Larry Stockmeyer

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds

Computational Complexity
NL-printable sets and nondeterministic Kolmogorov complexity

Theoretical Computer Science - Logic, language, information and computation
Lower bounds for non-black-box zero knowledge

Journal of Computer and System Sciences - Special issue on FOCS 2003
Language compression and pseudorandom generators

Computational Complexity
Derandomizing Arthur-Merlin games using hitting sets

Computational Complexity
Low-end uniform hardness vs. randomness tradeoffs for AM

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling

Computational Complexity
Infeasibility of instance compression and succinct PCPs for NP

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Undirected connectivity in log-space

Journal of the ACM (JACM)
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity
Arthur and Merlin as Oracles

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Limitations of Hardness vs. Randomness under Uniform Reductions

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Unconditional Lower Bounds against Advice

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Pseudorandom Generators and Typically-Correct Derandomization

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
BQP and the polynomial hierarchy

Proceedings of the forty-second ACM symposium on Theory of computing
Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing
Typically-correct derandomization

ACM SIGACT News
Uniform derandomization from pathetic lower bounds

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Journal of Computer and System Sciences
Infeasibility of instance compression and succinct PCPs for NP

Journal of Computer and System Sciences
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP

ACM Transactions on Computation Theory (TOCT)
On the optimal compression of sets in PSPACE

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Pseudorandomness and derandomization

XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
A note on zero error algorithms having oracle access to one NP query

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The complexity of solving linear equations over a finite ring

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Relations between average-case and worst-case complexity

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hardness hypotheses, derandomization, and circuit complexity

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Nonuniform ACC Circuit Lower Bounds

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional hardness versus randomness results focus on time-efficient randomized decision procedures. We generalize these trade-offs to a much wider class of randomized processes. We work out various applications, most notably to derandomizing Arthur-Merlin games. We show that every language with a bounded round Arthur-Merlin game has subexponential size membership proofs for infinitely many input lengths unless exponential time coincides with the third level of the polynomial-time hierarchy (and hence the polynomial-time hierarchy collapses). Since the graph nonisomorphism problem has a bounded round Arthur-Merlin game, this provides the first strong evidence that graph nonisomorphism has subexponential size proofs. We also establish hardness versus randomness trade-offs for space bounded computation.