Journal cover

computational complexity

Volume 4, issue 4, December 1994

8 articles in this issue

Special issue on circuit complexity: Foreword

Authors
- Pierre McKenzie
- Denis Thérien
- Content type: EditorialNotes
- Published: 01 December 1994
- Pages: 297 - 300
On the degree of boolean functions as real polynomials

Authors
- Noam Nisan
- Mario Szegedy
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 301 - 313
When do extra majority gates help? Polylog (N) majority gates are equivalent to one

Authors
- Richard Beigel
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 314 - 324
Complex polynomials and circuit lower bounds for modular counting

Authors
- David A. Mix Barrington
- Howard Straubing
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 325 - 338
Perceptrons, PP, and the polynomial hierarchy

Authors
- Richard Beigel
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 339 - 349
On ACC

Authors
- Richard Beigel
- Jun Tarui
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 350 - 366
Representing Boolean functions as polynomials modulo composite numbers

Authors
- David A. Mix Barrington
- Richard Beigel
- Steven Rudich
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 367 - 382
Circuits constructed with MOD_q gates cannot compute “AND” in sublinear size

Authors
- Denis Thérien
- Content type: OriginalPaper
- Published: 01 December 1994
- Pages: 383 - 388