James Aspnes, Richard Beigel, Merrick Furst, Steven Rudich  Home/Search
Context Related
| yale.edu:4201/home/stoc91voting.ps yale.edu:4201/home/stoc91voting.ps lehigh.edu/~beigel...ombinatorica.PS.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu:4201/h...votingabstract (more) From: lehigh.edu/~beigel/papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of approximating a Boolean function f : f0; 1g n ! f0; 1g by the sign of an integer polynomial p of degree k. For us, a polynomial p(x) predicts the value of f(x) if, whenever p(x) 0, f(x) = 1, and whenever p(x) ! 0, f(x) = 0. A low-degree polynomial p is a good approximator for f if it predicts f at almost all points. Given a positive integer k, and a Boolean function f , we ask, "how good is the best degree k approximation to f?" We introduce a new lower bound... (Update)
Cited by: More
Polynomials that Sign Represent Parity and Descartes.. - Basu, Bhatnagar.. (Correct)
Some Meet-in-the-Middle Circuit Lower Bounds - Hansen, Miltersen (2004) (Correct)
Extremal Properties of Polynomial Threshold Functions - O'Donnell, Servedio (2003) (Correct)
Similar documents (at the sentence level):
79.8%: The Expressive Power of Voting Polynomials - Aspnes, Beigel, Furst, Rudich (1993) (Correct)
Active bibliography (related documents): More All
0.0: Counting Complexity - Fortnow (1997) (Correct)
0.0: Immunity and Simplicity for Exact Counting and Other Counting.. - Rothe (1998) (Correct)
0.0: Counting Classes: Thresholds, Parity, Mods, and Fewness - Richard Beigel, John Gill (1996) (Correct)
Similar documents based on text: More All
0.5: The Polynomial Method in Circuit Complexity - Beigel (1995) (Correct)
0.2: Noise-Resistant Boolean-Functions are Juntas - Kindler, Safra (2003) (Correct)
0.2: Perceptrons, PP, And The Polynomial Hierarchy - Beigel (1992) (Correct)
Related documents from co-citation: More All
22: Algebraic methods in the theory of lower bounds for Boolean circuit complexity (context) - Smolensky - 1987
18: Threshold circuits of bounded depth (context) - Hajnal, Maass et al. - 1987
16: PP is Closed under Intersection - Beigel, Reingold et al. - 1991
BibTeX entry: (Update)
James Aspnes, Richard Beigel, Merrick L. Furst, and Steven Rudich. The expressive power of voting polynomials. In Proceedings of the 23rd ACM Symposium on Theory of Computation, pages 402409. Association for Computing Machinery, 1991. http://citeseer.ist.psu.edu/article/aspnes93expressive.html More
@inproceedings{ aspnes91expressive,
author = "James Aspnes and Richard Beigel and Merrick Furst and Steven Rudich",
title = "The expressive power of voting polynomials",
pages = "402--409",
year = "1991",
url = "citeseer.ist.psu.edu/article/aspnes93expressive.html" }
Citations (may not include all citations):109 Relative to a random oracle (context) - Bennett, Gill
25 The perceptron strikes back - Beigel, Reingold et al. - 1991
18 Relativized counting classes: Relations among thresholds - Beigel - 1991
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC