|
3
|
Th' erien, Non-uniform automata over groups
– D A M Barrington, H Straubing, D
- 1990
|
|
1
|
A degree-decreasing lemma for (mod q,mod p) circuits
– V Grolmusz
- 1443
|
|
8
|
astad, Almost Optimal Lower Bounds for Small Depth Circuits
– J H
- 1989
|
|
8
|
Exponential size lower bounds for some depth three circuits
– P Y Yan, I Parberry
- 1994
|
|
4
|
A note on a theorem of
– H Caussinus
- 1996
|
|
21
|
bounds on the size of bounded depth networks over a complete basis with logical addition
– Lower
- 1987
|
|
43
|
Non-uniform automata over groups
– D A MIx BARRINGTON, H STRAUBING, D THERIEN
- 1990
|
|
32
|
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
– J van Leeuwen
- 1990
|
|
43
|
Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan--in
– Waack
- 1991
|
|
9
|
Meshulam: On mod p Transversals
– J Kahn, R
|
|
13
|
1 -formulae on structures
– Miklos Ajtai
- 1983
|
|
28
|
Leeuwen (editor), Handbook of Theoretical Computer Science, volume
– J van
- 1990
|
|
49
|
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates
– Matthias Krause, Pavel Pudlák, Lehrstuhl Informatik Ii
- 2000
|
|
85
|
On ACC and threshold circuits
– AC Yao
- 1990
|
|
121
|
Lower bounds for the monotone complexity of some boolean functions
– A A Razborov
- 1985
|
|
167
|
Separating the Polynomial-Time Hierarchy by Oracles
– A Yao
- 1985
|
|
115
|
circuits, and the polynomial time hierarchy
– M L FURST, J B SAXE, M Parity SIPSER
|
|
262
|
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
– Roman Smolensky
- 1987
|
|
159
|
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
– Benny Chor, Oded Goldreich
- 1988
|
