A Ramsey-theoretic argument is used to obtain the first lower bounds for approximations over Zm by nonlinear polynomials. Nonapproximability results imply the first known lower bounds on the top of MAJ · MODm · AND0(1) circuits that compute parity.
|Number of pages||4|
|Journal||Proceedings of the Annual IEEE Conference on Computational Complexity|
|State||Published - 2001|
|Event||16th Annual IEEE Conference on Computational Complexity - Chicago, IL, United States|
Duration: 18 Jun 2001 → 21 Jun 2001