Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Approximate inclusion-exclusion
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The growth of polynomials bounded at equally spaced points
SIAM Journal on Mathematical Analysis
PP is closed under intersection
Selected papers of the 23rd annual ACM symposium on Theory of computing
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
Perceptrons, PP, and the polynomial hierarchy
Computational Complexity - Special issue on circuit complexity
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
On Quantum Versions of the Yao Principle
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
A Lattice Problem in Quantum NP
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Learning functions of k relevant variables
Journal of Computer and System Sciences - Special issue: STOC 2003
The Quantum Adversary Method and Classical Formula Size Lower Bounds
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lower bounds on matrix rigidity via a quantum argument
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
| Hi-index | 0.00 |
The degrees of polynomials representing or approximating Boolean functions are aprominent tool in various branches of complexity theory. Sherstov [31] recently characterizedthe minimal degree degε(f) among all polynomials (over R) that approximatea symmetric function f : {0, 1}n → {0, 1} up to worst-case error ε: degε(f) =Θ(deg1/3(f) + √n log(1/ε). In this note we show how a tighter version (without thelog-factors hidden in the Θ-notation), can be derived quite easily using the close connectionbetween polynomials and quantum algorithms.