A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits (2001)

by Vince Grolmusz
Citations:1 - 1 self

Active Bibliography

1 Lower Bounds for (MOD p - MOD m) Circuits – Vince Grolmusz, Gabor Tardos - 1998
30 Circuit Complexity before the Dawn of the New Millennium – Eric Allender - 1997
16 Non-uniform ACC circuit lower bounds – Ryan Williams - 2010
10 Upper and Lower Bounds for Some Depth-3 Circuit Classes – Richard Beigel, Alexis Maciel - 1997
2 On the Power of Circuits with Gates of Low L_1 Norms – Vince Grolmusz - 1995
2350 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
70 The Polynomial Method in Circuit Complexity – Richard Beigel - 1993
8 Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications – Vince Grolmusz - 2002
10 A Weight-Size Trade-Off for Circuits with MOD m Gates – Vince Grolmusz - 1994
4 Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates – Meera Sitharam - 1995
1 Polynomial Programs and the Razborov-Smolensky Method – Hubie Chen - 2001
unknown title – Boolean Circuit Lower Bounds, Lecturer Avi Wigderson, Scribers V. Anuradha, Yuri Pritykin
13 Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates – Frederic Green - 1999
103 On the power of small-depth threshold circuits – Johan Hastad, Mikael Goldmann - 1990
19 Counting Hierarchies: Polynomial Time And Constant Depth Circuits – Eric W. Allender, Klaus W. Wagner - 1990
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
2 A note on a theorem of Barrington, Straubing and Thérien – Hervé Caussinus - 1996
56 Representing Boolean Functions As Polynomials Modulo Composite Numbers – David A. Mix Barrington, Richard Beigel, Steven Rudich - 1994
11 Some Problems Involving Razborov-Smolensky Polynomials – David A. Mix Barrington - 1991