1. Nondeterministic instance complexity and hard-to-prove tautologies;Arvind,2000
2. Logarithmic advice classes;Balcázar;Theoret. Comput. Sci.,1992
3. Structural Complexity I;Balcázar,1988
4. Nondeterministic instance complexity and proof systems with advice;Beyersdorff,2009
5. A tight Karp–Lipton collapse result in bounded arithmetic;Beyersdorff;ACM Trans. Comput. Log.,2010