|
1
|
A View of Structural Complexity Theory
– Ronald V. Book, Osamu WATANABE
|
|
5
|
Every Polynomial-Time 1-Degree Collapses iff P = PSPACE
– Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
- 1996
|
|
3
|
DSPACE(n) ? = NSPACE(n): A degree theoretic characterization
– Manindra Agrawal
- 1995
|
|
14
|
Complete Sets and Structure in Subrecursive Classes
– Harry Buhrman, Leen Torenvliet
- 1998
|
|
17
|
On the Existence of Hard Sparse Sets under Weak Reductions
– Jin-Yi Cai, Ashish V. Naik, D. Sivakumar
- 1996
|
|
|
The Isomorphism Conjecture for NP
– Manindra Agrawal
- 2009
|
|
9
|
The Isomorphism Conjecture Holds and One-way Functions Exist Relative to an Oracle
– John Rogers
- 1994
|
|
41
|
The Isomorphism Conjecture Fails Relative to a Random Oracle
– Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
- 1996
|
|
|
A note on the Isomorphism Conjecture and one-way functions
– John D. Rogers
|
|
2
|
Tally NP Sets and Easy Census Functions
– Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
- 1998
|
|
13
|
Splittings, Robustness and Structure of Complete Sets
– Harry Buhrman, Albrecht Hoene, Leen Torenvliet
- 1993
|
|
18
|
Pseudo-random generators and structure of complete degrees
– Manindra Agrawal
- 2002
|
|
1
|
Sparse Hard Sets for P
– Dieter van Melkebeek, Mitsunori Ogihara
- 1996
|
|
3
|
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis
– Jin-yi Cai, D. Sivakumar
|
|
13
|
The Resolution of a Hartmanis Conjecture
– Jin-Yi Cai, D. Sivakumar
- 1995
|
|
5
|
Space-Efficient Recognition Of Sparse Self-Reducible Languages
– Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda
- 1994
|
|
9
|
On the Structure of Low Sets
– Johannes Köbler
- 1995
|
|
47
|
An oracle builder’s toolkit
– Stephen Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
- 2002
|
|
|
Every Polynomial-Time 1-Degree Collapses if and only if P = PSPACE
– Stephen Fenner Stuart
|
