This paper furthers the study of quasi-linear time complexity initiated by Schnorr [Sch76] and Gurevich and Shelah [GS89]. We show that the fundamental properties of the polynomial-time hierarchy carry over to the quasilinear-time hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give a new construction using error-correcting codes that runs in quasilinear time. We show, however, that the important equivalence between search problems and decision problems in polynomial time is unlikely to carry over: if search reduces to decision for SAT in quasi-linear time, then all of NP is contained in quasipolynomial time. Other connections to work by Stearns and Hunt [SH86, SH90, HS90] on "power indices " of NP languages are made. Topics. Computational complexity.
|
2770
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
2003
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1287
|
The Theory of Error-Correcting Codes
– MacWilliams, Sloane
- 1977
|
|
470
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
208
|
Small bias probability spaces: efficient constructions and applications
– Naor, Naor
- 1993
|
|
190
|
The complexity of optimization problems
– Krentel
- 1988
|
|
174
|
Checking computations in polylogarithmic time
– Babai, Fortnow, et al.
- 1991
|
|
172
|
NP is as easy as detecting unique solutions
– Valiant, Vazirani
- 1986
|
|
164
|
PP is as hard as the polynomial-time hierarchy
– Toda
- 1991
|
|
111
|
Concatenated Codes
– Forney
- 1966
|
|
90
|
Construction of asymptotically good, lowrate error-correcting codes through pseudo-random graphs
– Alon, Bruck, et al.
- 1992
|
|
86
|
The quantitative structure of exponential time
– Lutz
- 1997
|
|
84
|
P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
– Selman
- 1979
|
|
73
|
Some connections between bounded query classes and non-uniform complexity
– Amir, Beigel, et al.
- 1990
|
|
72
|
Two remarks on the power of counting
– Papadimitriou, Zachos
- 1983
|
|
72
|
Bounded queries to SAT and the Boolean hierarchy
– Beigel
- 1991
|
|
70
|
Complete sets and the polynomial-time hierarchy
– Wrathall
- 1976
|
|
68
|
Probabilistic algorithms in finite fields
– RABIN
- 1980
|
|
60
|
Time bounded random access machines
– Cook, Reckhow
- 1973
|
|
59
|
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
– Sudan
- 1992
|
|
57
|
Nondeterminism within P
– Buss, Goldsmith
- 1993
|
|
52
|
The complexity and distribution of hard problems
– Juedes, Lutz
- 1995
|
|
49
|
Query-Limited Reducibilities
– Beigel
- 1987
|
|
47
|
New algorithms for finding irreducible polynomials over finite fields
– Shoup
- 1990
|
|
45
|
P-selective sets and reducing search to decision vs. self-reducibility
– Hemaspaandra, Naik, et al.
- 1996
|
|
45
|
The polynomial time hierarchy
– Stockmeyer
- 1976
|
|
42
|
A class of constructive asymptotically good algebraic codes
– Justesen
- 1972
|
|
42
|
Terse, superterse, and verbose sets
– Beigel, Gasarch, et al.
- 1993
|
|
33
|
Polynomial terse sets
– Amir, Gasarch
- 1988
|
|
33
|
A structural theorem that depends quantitatively on the complexity of sat
– Beigel
- 1987
|
|
30
|
On helping by robust oracle machines
– Ko
- 1987
|
|
26
|
Some observations on the probabilistic algorithms and NP-hard problems
– Ko
- 1982
|
|
24
|
Some Comments on Functional Self-Reducibility and the NP Hierarchy
– Borodin, Demers
- 1976
|
|
23
|
Randomness-optimal unique element isolation with applications to perfect matching and related problems
– Chari, Rohatgi, et al.
- 1995
|
|
22
|
Satisfiability is quasilinear complete in NQL
– Schnorr
- 1978
|
|
22
|
Structural Complexity Theory
– Balc'azar, D'iaz, et al.
- 1988
|
|
19
|
Quasipolynomial size circuit classes
– Barrington
- 1992
|
|
18
|
Natural self-reducible sets
– Selman
- 1988
|
|
17
|
The network complexity and Turing machine complexity of finite functions
– Schnorr
- 1976
|
|
17
|
Rudimentary predicates and relative computation
– Wrathall
- 1978
|
|
17
|
Bounded query classes and the difference hierarchy
– Beigel, Gasarch, et al.
- 1989
|
|
16
|
Languages that are Easier than their Proofs
– Beigel, Bellare, et al.
- 1991
|
|
15
|
Nearly-linear time
– Gurevich, Shelah
- 1989
|
|
15
|
Self-reducibility: Effects of internal structure on computational complexity
– Joseph, Young
- 1990
|
|
15
|
Counting, selecting, sorting by query-bounded machines
– Hoene, Nickelsen
- 1993
|
|
15
|
Robust algorithms: a different approach to oracles
– Schoning
- 1985
|
|
14
|
Fast decoding of codes from algebraic plane curves
– Justesen, Larsen, et al.
- 1992
|
|
13
|
Relativization of questions about log-space computability
– Ladner, Lynch
- 1976
|
|
13
|
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
– Shen
- 1993
|
|
12
|
Power indices and easier hard problems
– Stearns, Hunt
- 1990
|
|
