Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
type: Item
instance of: scholarly article
title: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
zbMATH Open document ID: 1345.68174
DOI: 10.1145/301250.301428
author: Adam R. Klivans
author: Dieter Van Melkebeek
published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing
publication date: 2016-09-29T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6631113
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/301250.301428
OpenAlex ID: W1979479253
description: scientific article; zbMATH DE number 6631113