Approximate inclusion-exclusion for arbitrary symmetric functions

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 112-123

  Sherstov, Alexander A ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE INCLUSION; SYMMETRIC FUNCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 51749093988     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.18     Document Type: Conference Paper

References (27)

1. S. Aaronson and Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. J. ACM, 51(4):595-605, 2004.
2. J. Aspnes, R. Beigel, M. L. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14(2):135-148, 1994.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. J. ACM, 48(4):778-797, 2001.
4. S. N. Bernstein. Sur la meilleure approximation de |x| par des polynômes de degrés donnés. Acta Math., 37:1-57, 1914.
5. H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka. Bounds for small-error and zero-error quantum algorithms. In Proc. of the 40th Symposium on Foundations of Computer Science (FOCS), pages 358-368, 1999.
6. H. Buhrman, N. K. Vereshchagin, and R. de Wolf. On computation and communication with small bias. In Proc. of the 22nd Conf. on Computational Complexity (CCC), pages 24-32, 2007.
7. E. W. Cheney. Introduction to Approximation Theory. Chelsea Publishing, New York, 2nd edition, 1982.
8. R. de Wolf. A note on quantum algorithms and the minimal degree of ∈-error polynomials for symmetric functions. Available at arXiv:0802.1816, February 2008.
9. R. A. DeVore and G. G. Lorentz. Constructive Approximation, volume 303. Springer-Verlag, Berlin, 1993.
10. A. Eremenko and P. Yuditskii. Uniform approximation of sgn(x) by polynomials and entire functions. J. d'Analyse Mathématique, 101:313-324, 2007.
11. A. D. Ioffe and V. M. Tikhomirov. Duality of convex functions and extremum problems. Russ. Math. Surv., 23(6):53-124, 1968.
12. D. Jackson. The Theory of Approximation. Amer. Math. Soc., Colloquium Publications, Vol. XI, New York, 1930.
13. J. Kahn, N. Linial, and A. Samorodnitsky. Inclusion-exclusion: Exact and approximate. Combinatorica, 16(4):465-477, 1996.
14. A. T. Kalai, A. R. Klivans, Y. Mansour, and R. A. Servedio. Agnostically learning halfspaces. In Proc. of the 46th Symposium on Foundations of Computer Science (FOCS), pages 11-20, 2005.
15. M. J. Kearns, R. E. Schapire, and L. Sellie. Toward efficient agnostic learning. Machine Learning, 17(2-3):115-141, 1994.
16. Õ(n1/3). J. Comput. Syst. Sci., 68(2):303-318, 2004.
17. A. R. Klivans and A. A. Sherstov. A lower bound for agnostically learning disjunctions. In Proc. of the 20th Conf. on Learning Theory (COLT), pages 409-423, 2007.
18. N. Linial and N. Nisan. Approximate inclusion-exclusion. Combinatorica, 10(4):349-365, 1990.
19. M. L. Minsky and S. A. Papert. Perceptrons: expanded edition. MIT Press, Cambridge, Mass., 1988.
20. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions. In Proc. of the 24th Symposium on Theory of Computing, pages 468-474, 1992.
21. A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, Mathematics, 67:145-159, 2002.
22. A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67(1):145-159, 2003.
23. T. J. Rivlin. An Introduction to the Approximation of Functions. Dover Publications, New York, 1981.
24. A. A. Sherstov. Unbounded-error communication complexity of symmetric functions. Technical Report TR-07-53, The Univ. of Texas at Austin, Dept. of Computer Sciences, September 2007.
25. A. A. Sherstov. The pattern matrix method for lower bounds on quantum communication. In Proc. of the 40th Symposium on Theory of Computing (STOC), 2008. To appear.
26. Y. Shi and Y. Zhu. Quantum communication complexity of block-composed functions. Available at arXiv:0710.0095v1, 29 September 2007.
27. J. Tarui and T. Tsukiji. Learning DNF by approximating inclusion-exclusion formulae. In Proc. of the 14th Conf. on Computational Complexity, pages 215-221, 1999.