|
365
|
Recursively Enumerable Sets and Degrees
– Soare
- 1987
|
|
205
|
A comparison of polynomial time reducibilities
– Ladner, Lynch, et al.
- 1975
|
|
28
|
Polynomial and abstract subrecursive classes
– Mehlhorn
- 1976
|
|
20
|
A comparison of polynomial time reducibilities, Theoret
– Ladner, Lynch, et al.
- 1975
|
|
17
|
Sublattices of the polynomial time degrees
– Ambos-Spies
- 1985
|
|
17
|
Classical Recursion Theory, Vol
– Odifreddi
- 1989
|
|
17
|
A uniform approach to obtain diagonal sets in complexity classes
– Schoning
- 1982
|
|
15
|
An observation on probability versus randomness with applications to complexity classes
– Book, Lutz, et al.
- 1994
|
|
10
|
On the structure of sets in NP and other complexity classes. Theoret
– Landweber, Lipton, et al.
- 1981
|
|
8
|
A note on structure and looking back applied to the relative complexity of computable functions
– Chew, Machtey
- 1981
|
|
8
|
On closure properties of bounded twosided error complexity classes
– Regan, Royer
- 1995
|
|
7
|
On polynomial and generalized complexity cores
– Book, Du, et al.
- 1988
|
|
7
|
The topology of provability in complexity theory
– Regan
- 1988
|
|
7
|
The recursion-theoretic structure of complexity classes
– Schmidt
- 1985
|
|
6
|
On splitting recursive sets
– Breidbart
- 1978
|
|
6
|
A Generalized Account of Resource Bounded Reducibilities. Doctoral dissertation
– Merkle
- 1997
|
|
6
|
Gap-languages and log-time complexity classes
– Regan, Vollmer
- 1997
|
|
4
|
Structural properties of bounded relations with an application to NP optimization problems. Theoretical Computer Science
– Merkle
- 2001
|
|
4
|
Random separations and "Almost" classes for generalized reducibilities
– Merkle, Wang
- 1995
|
|
3
|
On nondeterminism, enumeration reducibility and polynomial bounds
– Copestake
- 1997
|
|
3
|
Minimal pairs for P
– Schoning
- 1984
|
|
3
|
A note on a theorem of Ladner
– Balc'azar, Diaz
- 1982
|
|
2
|
Polynomial time reducibilities and degrees
– Ambos-Spies
- 1999
|
|
2
|
Josep Daz, and Joaquim Gabarro. Structural Complexity, volume I
– Balcazar
- 1995
|
|
2
|
Josep Daz, and Joaquim Gabarro
– Balcazar
- 1988
|
|
2
|
On the structure of subrecursive degrees
– Basu
- 1970
|
|
2
|
Minimal pairs of polynomial degrees with subexponential complexity
– Machtey
- 1976
|
|
2
|
Exact pairs for abstract bounded reducibilities
– Merkle
- 1999
|
|
2
|
The Parallel Approximability of P-Complete Problems, Tesis doctoral, Universitat Politècnica de Catalunya
– Serna
- 1990
|
|
2
|
The gap-language-technique revisited
– Vollmer
|
|
1
|
Balcazar and Josep Daz. A note on a theorem by
– Luis
- 1982
|
|
1
|
Random separations and \Almost" classes for generalized reducibilities. Mathematical Logic Quarterly
– Merkle, Wang
- 2001
|
|
1
|
Abstract degree structures
– Mueller
- 1991
|
|
1
|
Joaquim Gabarr'o. Structural Complexity, volume I
– Balc'azar, D'iaz
- 1995
|
|
