Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán. Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. In Horst Reichel, Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings. Volume 1770 of Lecture Notes in Computer Science, pages 314-323, Springer, 2000. [doi]
Abstract is missing.