Abstract:
All polynomial many-one degrees are shown to be of second Baire category in the superset topology when witness functions are allowed to run in 2 log h
Citations
|
2771
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
86
|
The quantitative structure of exponential time
– Lutz
- 1997
|
|
57
|
Measure on small complexity classes, with applications for BPP
– Allender, Strauss
- 1994
|
|
55
|
Almost every set in exponential time is P-bi-immune
– Mayordomo
- 1994
|
|
42
|
The isomorphism conjecture fails relative to a random oracle
– Kurtz, Mahaney, et al.
- 1989
|
|
30
|
Oracles for structural properties: The isomorphism problem and public-key cryptography
– Homer, Selman
- 1992
|
|
28
|
The structure of complete degrees
– Kurtz, Mahaney, et al.
- 1990
|
|
23
|
Some remarks on witness functions for non-polynomial and non-complete sets
– Joseph, Young
- 1985
|
|
20
|
Notions of resource-bounded category and genericity
– Fenner
- 1991
|
|
18
|
Robust machines accept easy sets
– Hartmanis, Hemachandra
- 1990
|
|
8
|
A relativized failure of the Berman-Hartmanis conjecture
– Kurtz
- 1983
|
|
6
|
The isomorphism conjecture fails relative to a generic oracle
– Kurtz
- 1988
|
|
4
|
Category and measure in complexity theory
– Lutz
- 1990
|
|
3
|
On three theorems in abstract complexity theory: A topological glimpse
– Calude, Zimand
- 1992
|
|
1
|
Baire category classification in abstract complexity theory
– Calude, Zimand
- 1993
|
|
1
|
On p-creative sets and p-completely creative sets
– Wang
- 1991
|
|
1
|
If not empty, NP-P is topologically large
– Zimand
- 1993
|
|
