|
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
|
|
139
|
Gap-definable counting classes
– Fenner, Fortnow, et al.
- 1994
|
|
92
|
PP is closed under intersection
– Beigel, Reingold, et al.
- 1995
|
|
70
|
On relating time and space to size and depth
– Borodin
- 1977
|
|
60
|
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
– Vinay
- 1991
|
|
57
|
A very hard log-space counting class
– Àlvarez, Jenner
- 1993
|
|
50
|
A uniform approach to define complexity classes
– Bovet, Crescenzi, et al.
- 1992
|
|
49
|
Finite Monoids and the Fine Structure of NC
– Barrington, Th'erien
- 1988
|
|
38
|
An optimal parallel algorithm for formula evaluation
– Buss, Cook, et al.
- 1992
|
|
37
|
The complexity of computing the permanent. Theoretical Computer Science, 8:189–201
– Valiant
- 1979
|
|
36
|
On Balanced vs. Unbalanced Computation Trees
– Hertrampf, Wagner
- 1994
|
|
35
|
Relationships among PL, #L, and the determinant
– Allender, Ogihara
- 1996
|
|
30
|
A uniform circuit lower bound for the permanent
– Allender, Gore
- 1994
|
|
29
|
Computing Algebraic Formulas Using a Constant Number of Registers
– Ben-Or, Cleve
- 1988
|
|
29
|
On counting and approximation
– Kobler, Schoning, et al.
- 1989
|
|
28
|
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions
– Wagner
- 1994
|
|
27
|
On the power of polynomial time bit-reductions
– Hertrampf, Lautemann, et al.
- 1993
|
|
23
|
Logspace and logtime leaf languages
– Jenner, McKenzie, et al.
- 1994
|
|
23
|
Classes of arithmetic circuits capturing the complexity of computing the determinant
– Toda
- 1992
|
|
17
|
Descriptive complexity of #P functions
– Saluja, Subrahmanyam, et al.
- 1995
|
|
16
|
Word problems solvable in logspace
– Lipton, Zalcstein
- 1977
|
|
16
|
Some observations on the connection between counting and recursion
– Wagner
- 1986
|
|
13
|
NC : The automata-theoretic viewpoint
– McKenzie, P'eladeau, et al.
- 1991
|
|
13
|
Bits and relative order from residues, space efficiently
– Dietz, Macarie, et al.
- 1994
|
|
12
|
On strong separations from AC
– Allender, Gore
- 1991
|
|
11
|
Unambiguity of circuits
– Lange
- 1993
|
|
10
|
A note on uniform circuit lower bounds for the counting hierarchy
– Allender
- 1996
|
|
6
|
Depth efficient transformations of arithmetic into boolean circuits
– Jung
- 1985
|
|
5
|
On balanced vs. unbalanced computation trees. Mathematical Systems Theory
– Hertrampf, Vollmer, et al.
|
|
4
|
Some questions concerning circuit counting classes and other low level complexity classes
– Jiao
- 1992
|
|
3
|
Extensions to Barrington's M-program model, Theoret
– B'edard, Lemieux, et al.
- 1993
|
|
2
|
Comparing Counting Classes for Logspace, One-Way Logspace, and First-Order
– Burtschick
- 1995
|
|
2
|
Complexity classes defined via k-valued logic
– Hertrampf
- 1994
|
|
2
|
Contributions `a l"etude du non-d'eterminisme restreint
– Caussinus
- 1996
|
|
