A Lower Bound On The Mod 6 Degree Of The Or Function (1995)
by
Gabor Tardos
,
David A. Mix Barrington
| Venue: | Computational Complexity |
| Citations: | 20 - 1 self |
BibTeX
@ARTICLE{Tardos95alower,
author = {Gabor Tardos and David A. Mix Barrington},
title = {A Lower Bound On The Mod 6 Degree Of The Or Function},
journal = {Computational Complexity},
year = {1995},
volume = {7},
pages = {52--56}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We examine the computational power of modular counting, where the modulus m is not a prime power, in the setting of polynomials in boolean variables over Zm . In particular, we say that a polynomial P weakly represents a boolean function f (both have n variables) if for any inputs x and y in f0; 1g n we have P (x) 6= P (y) whenever f(x) 6= f(y).
Citations
| 262 | Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987 |
| 100 | Constant depth reducibility - Chandra, Stockmeyer, et al. - 1984 |
| 96 | Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs - Babai, Nisan, et al. - 1992 |
| 75 | Lower bounds for the size of circuits of bounded depth with basis - Razborov - 1987 |
| 57 | The polynomial method in circuit complexity - Beigel - 1993 |
| 53 | Representing boolean functions as polynomials modulo composite numbers, Computational Complexity 4 - Barrington, Beigel, et al. - 1994 |
| 15 | Diophantine problems in variables restricted to the values 0 and 1 - Baker, Schmidt - 1980 |
| 7 | The complexity of functions - Boppana, Sipser - 1990 |
| 1 | Quasipolynomial size circuit complexity - Barrington - 1992 |
| 1 | On the weak mod-m representation of Boolean functions - Grolmusz - 1995 |
