|
47
|
Relativizations of the P=?NP question
– T Baker, J Gill, R Solovay
- 1975
|
|
210
|
Computational complexity of probabilistic Turing machines
– J Gill
- 1977
|
|
9
|
Relativizations of unambiguous and random polynomial time classes
– J Geske, J Grollmann
- 1986
|
|
129
|
Complexity measures for public-key cryptosystems
– Joachim Grollmann, Lehrstuhl Informatik I
- 1988
|
|
4
|
Are There Interactive Protocols for co-NP
– L Fortnow, M Sipser
- 1988
|
|
46
|
A uniform approach to define complexity classes, Theoretical Computer Science 104
– D P Bovet, P Crescenzi, R Silvestri
- 1992
|
|
236
|
The polynomial-time hierarchy
– L Stockmeyer
- 1977
|
|
74
|
Complete sets and the polynomial-time hierarchy
– C Wrathall
- 1976
|
|
8
|
Strong separations of the polynomial hierarchy with oracles: constructive separations by immune and simple sets
– D Bruschi
- 1992
|
|
41
|
On the construction of parallel computers from various bases of boolean functions
– L Goldschlager, I Parberry
- 1986
|
|
4
|
Immunity and simplicity in relativizations of probabilistic complexity classes
– J Balcázar, D Russo
- 1988
|
|
3377
|
Introduction to Automata Theory, Languages, and Computation
– J Hopcroft, J Ullman
- 1979
|
|
3
|
Polylog-time reductions decrease dot-depth
– C Glaßer
- 2005
|
|
3
|
Leaf language classes
– K W Wagner
- 2004
|
|
3
|
On the power of unambiguity in alternating machines
– Holger Spakowski, Rahul Tripathi
- 2004
|
|
13
|
On the acceptance power of regular languages
– Bernd Borchert
- 1995
|
|
14
|
Lindström Quantifiers and Leaf Language Definability
– Hans-Jörg Burtschick, Heribert Vollmer
- 1996
|
|
48
|
Polynomial closure and unambiguous product, Theory of Computing Systems 30
– J-E Pin, P Weil
- 1997
|
|
6
|
The Characterization of the Leaf Language Classes
– Bernd Borchert, Riccardo Silvestri
- 1994
|
