Skip to content

Opening book details…

About this scholarly article

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 - Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses by Klivans, Adam R.; van Melkebeek, Dieter is a scholarly article available to read on EtoBox.

Author
Klivans, Adam R.; van Melkebeek, Dieter
Publisher
ACM Press
Published
1999
Language
EN

More by Klivans, Adam R.; van Melkebeek, Dieter

Browse all works by Klivans, Adam R.; van Melkebeek, Dieter