The central theme of this paper is the construction of an oracle A such that NEXP A
|
370
|
Recursively Enumerable Sets and Degrees
– Soare
- 1987
|
|
229
|
The polynomial-time hierarchy
– Stockmeyer
- 1977
|
|
161
|
On isomorphism and density of NP and other complete sets
– Berman, Hartmanis
- 1977
|
|
160
|
Structural Complexity I
– Balcázar, Díaz, et al.
- 1988
|
|
151
|
On the Computational Complexity of of Algorithms
– Hartmanis, Stearns
- 1965
|
|
139
|
Complexity measures for public-key cryptosystems
– Grollmann, Selman
- 1988
|
|
86
|
P-selective sets, tally languages, and the behavior of polynomial-time reducibilities on NP
– Selman
- 1979
|
|
83
|
Generic oracles and oracle classes
– Blum, Impagliazzo
- 1987
|
|
52
|
Sparse sets
– Hartmanis, Immerman, et al.
- 1985
|
|
49
|
The strong exponential hierarchy collapses
– Hemachandra
- 1987
|
|
44
|
On truth-table reducibility to SAT
– Buss, Hay
- 1991
|
|
43
|
Polynomial Reducibilities and Complete Sets
– Berman
- 1977
|
|
41
|
Separating nondeterministic time complexity classes
– Seiferas, Fischer, et al.
- 1978
|
|
37
|
Nonrelativizing separations
– Buhrman, Fortnow, et al.
- 1998
|
|
35
|
1957], Two recursively enumerable sets of incomparable degrees of unsolvability
– Friedberg
|
|
32
|
The isomorphism conjecture holds relative to an oracle
– Fenner, Fortnow, et al.
- 1992
|
|
31
|
Oracles for structural properties: The isomorphism problem and public-key cryptography
– Homer, Selman
- 1992
|
|
24
|
On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl
– Muchnik
|
|
23
|
One-way functions and the nonisomorphism of NP-complete sets
– Hartmanis, Hemachandra
- 1991
|
|
22
|
NP might not be as easy as detecting unique solutions
– Beigel, Buhrman, et al.
- 1998
|
|
15
|
Decision Versus Search Problems in SuperPolynomial Time
– Impagliazzo, Tardos
- 1989
|
|
10
|
On the cutting edge of relativization: The resource bounded injury method
– Buhrman, Torenvliet
- 1994
|
|
5
|
Using bounded query classes to separate classes in the exponential time hierarchy from classes
– Mocas
- 1994
|
|
5
|
Recursively enumerable sets of integers and their decision problems
– Post
- 1944
|
|
5
|
Relativized questions involving probabilistic algorithms
– Racko
- 1982
|
|
5
|
A study of the Structure of NP
– Sewelson
- 1485
|
|
4
|
An application of the translational method
– Fu, Li, et al.
- 1994
|
|
4
|
On relativized polynomial and exponential computations
– Heller
- 1984
|
|
2
|
A note on one-way funtions and polynomialtime isomorphisms
– Ko, Long, et al.
- 1987
|
|
2
|
A Turing machine hierarchy
– Z'ak
- 1983
|
|
