A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
BRICS Report Series
We prove that AM (and hence Graph Nonisomorphism) is in NP<br />if for some epsilon > 0, some language in NE intersection coNE requires nondeterministic<br />circuits of size 2^(epsilon n). This improves recent results of Arvind<br />and K¨obler and of Klivans and Van Melkebeek who proved the same<br />conclusion, but under stronger hardness assumptions, namely, either<br />the existence of a language in NE intersection coNE which cannot be approximated<br />by nondeterministic circuits of sizedoi:10.7146/brics.v6i47.20117 fatcat:2ecf3j6i55cqnfvfernj4dxguy