Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses

DOI10.1145/301250.301428zbMath1345.68174MaRDI QIDQ2819595

Dieter van Melkebeek, Adam R. Klivans

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301428

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

68W20: Randomized algorithms

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

03F20: Complexity of proofs

Related Items

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings, Pseudorandom generators without the XOR lemma, Easiness assumptions and hardness tests: Trading time for zero error, Pseudo-random generators for all hardnesses, \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\), Martingale families and dimension in P, Interactive and probabilistic proof-checking, In search of an easy witness: Exponential time vs. probabilistic polynomial time., Isolation, matching, and counting uniform and nonuniform upper bounds, A zero-one law for RP and derandomization of AM if NP is not small, Robust simulations and significant separations, Baire categories on small complexity classes and meager-comeager laws