Download:
|
by David Mix Barrington, Neil Immerman
http://www.cs.umass.edu/~immerman/pub/uniform.ps
Add To MetaCart
Abstract:
time, amount of hardware, and degree of non-uniformity, which together parametrize most complexity classes. We show that the descriptive complexity framework neatly captures these measures using three parameters: quantifier depth, number of variables, and type of numeric predicates, respectively. A fairly simple picture arises in which the basic questions in complexity theory--- solved and unsolved--- can be understood as questions about tradeoffs among these three dimensions. 1
Citations
|
272
|
Relational queries computable in polynomial time
– Immerman
- 1986
|
|
243
|
Languages that capture complexity classes
– Immerman
- 1987
|
|
232
|
Nondeterministic space is closed under complement
– Immerman
- 1988
|
|
186
|
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
– Barrington
- 1989
|
|
151
|
On Uniformity within NC
– Barrington, Immerman, et al.
- 1990
|
|
140
|
On uniform circuit complexity
– Ruzzo
- 1981
|
|
116
|
Log depth circuits for division and related problems
– Beame, Cook, et al.
- 1984
|
|
86
|
On ACC and threshold circuits
– Yao
- 1990
|
|
59
|
On threshold circuits and polynomial computation
– Reif, Tate
- 1992
|
|
58
|
Expressibility and parallel complexity
– Immerman
- 1989
|
|
48
|
The complexity of iterated multiplication
– Immerman, Landau
- 1995
|
|
39
|
P-uniform circuit complexity
– Allender
- 1989
|
|
30
|
A uniform circuit lower bound for the permanent
– Allender, Gore
- 1994
|
|
21
|
Dspace[n k ] = var[k + 1
– Immerman
- 1991
|
|
19
|
Quasipolynomial size circuit classes
– Barrington
- 1992
|
|
18
|
The resolution of a Hartmanis conjecture
– Cai, Sivakumar
- 1995
|
|
14
|
Computable Quantifiers and Logics over Finite Structures
– Makowsky, Pnueli
- 1993
|
|
13
|
The power of the middle bit of a #P function
– Green, obler, et al.
- 1995
|
|
13
|
Descriptive and Computational Complexity," in Computational Complexity Theory
– Immerman
- 1989
|
|
12
|
A purely logical characterization of circuit uniformity
– Lindell
- 1992
|
|
11
|
An arithmetical model of computation equivalent to threshold circuits, Theoretical Computer Science 93
– Boyar, Frandsen, et al.
- 1992
|
|
11
|
PSPACE survives three-bit bottlenecks
– Cai, Furst
- 1987
|
|
10
|
Reducibility By Algebraic Projections," L'Enseignement math'ematique
– Valiant
- 1982
|
|
6
|
Some results on uniform arithmetic circuit complexity
– Frandsen, Valence, et al.
- 1994
|
|
5
|
Reducing P to a sparse set using a constant number of queries collapses P to L
– Melkebeek
- 1996
|
|
4
|
Turing machines that take advice", Enseign
– Karp, Lipton
- 1982
|
|
3
|
Extensions of an idea of McNaughton
– Barrington
- 1990
|
|
2
|
and Uzi Vishkin, "Simulation of Parallel Random Access Machines by Circuits
– Stockmeyer
- 1984
|
|
1
|
Sparse P-hard sets yield space-efficient algorithms
– Ogihara
- 1995
|
