Document Open Access Logo

On the Probabilistic Degrees of Symmetric Boolean Functions

Authors Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2019.28.pdf
  • Filesize: 0.54 MB
  • 14 pages

Document Identifiers

Author Details

Srikanth Srinivasan
  • Department of Mathematics, Indian Institute of Technology Bombay, Mumbai, India
Utkarsh Tripathi
  • Department of Mathematics, Indian Institute of Technology Bombay, Mumbai, India
S. Venkitesh
  • Department of Mathematics, Indian Institute of Technology Bombay, Mumbai, India

Funding

  • Srinivasan, Srikanth: Supported by MATRICS grant MTR/2017/000958 awarded by SERB, Government of India.
  • Tripathi, Utkarsh: Supported by the Ph.D. Scholarship of NBHM, DAE, Government of India.
  • Venkitesh, S.: Supported by the Senior Research Fellowship of HRDG, CSIR, Government of India.

Cite AsGet BibTex

Srikanth Srinivasan, Utkarsh Tripathi, and S. Venkitesh. On the Probabilistic Degrees of Symmetric Boolean Functions. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 28:1-28:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.FSTTCS.2019.28

Abstract

The probabilistic degree of a Boolean function f:{0,1}^n -> {0,1} is defined to be the smallest d such that there is a random polynomial P of degree at most d that agrees with f at each point with high probability. Introduced by Razborov (1987), upper and lower bounds on probabilistic degrees of Boolean functions - specifically symmetric Boolean functions - have been used to prove explicit lower bounds, design pseudorandom generators, and devise algorithms for combinatorial problems. In this paper, we characterize the probabilistic degrees of all symmetric Boolean functions up to polylogarithmic factors over all fields of fixed characteristic (positive or zero).

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational complexity and cryptography
Keywords
  • Symmetric Boolean function
  • probabilistic degree

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Josh Alman and Ryan Williams. Probabilistic polynomials and hamming nearest neighbors. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 136-150. IEEE, 2015. Google Scholar
  2. Richard Beigel. The polynomial method in circuit complexity. [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pages 82-95, 1993. Google Scholar
  3. Richard Beigel, Nick Reingold, and Daniel A. Spielman. The Perceptron Strikes Back. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991, pages 286-291, 1991. URL: https://doi.org/10.1109/SCT.1991.160270.
  4. Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, and Srikanth Srinivasan. On the Probabilistic Degree of OR over the Reals. In Sumit Ganguly and Paritosh Pandya, editors, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), volume 122 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:12, Dagstuhl, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.5.
  5. Mark Braverman. Polylogarithmic independence fools AC^0 circuits. J. ACM, 57(5), 2010. URL: https://doi.org/10.1145/1754399.1754401.
  6. Bettina Brustmann and Ingo Wegener. The Complexity of Symmetric Functions in Bounded-Depth Circuits. Inf. Process. Lett., 25(4):217-219, 1987. URL: https://doi.org/10.1016/0020-0190(87)90163-3.
  7. Devdatt P Dubhashi and Alessandro Panconesi. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, 2009. Google Scholar
  8. Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, and Larry J. Stockmeyer. Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Theor. Comput. Sci., 36:239-250, 1985. URL: https://doi.org/10.1016/0304-3975(85)90045-3.
  9. Prahladh Harsha and Srikanth Srinivasan. On Polynomial Approximations to AC⁰. In Klaus Jansen, Claire Mathieu, José D. P. Rolim, and Chris Umans, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016), volume 60 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1-32:14, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.32.
  10. David Lawrence Johnson, David Leroy Johnson, and SS Johnson. Topics in the theory of group presentations, volume 42. Cambridge University Press, 1980. Google Scholar
  11. Nathan Linial and Noam Nisan. Approximate inclusion-exclusion. Combinatorica, 10(4):349-365, 1990. Google Scholar
  12. Chi-Jen Lu. An exact characterization of symmetric functions in qAC⁰[2]. Theoretical Computer Science, 261(2):297-303, 2001. Google Scholar
  13. Raghu Meka, Oanh Nguyen, and Van Vu. Anti-concentration for Polynomials of Independent Random Variables. Theory of Computing, 12(1):1-17, 2016. URL: https://doi.org/10.4086/toc.2016.v012a011.
  14. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, New York, NY, USA, 2014. Google Scholar
  15. Ramamohan Paturi. On the degree of polynomials that approximate symmetric Boolean functions (preliminary version). In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 468-474. ACM, 1992. Google Scholar
  16. Alexander A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematicheskie Zametki, 41(4):598-607, 1987. (English translation in Mathematical Notes of the Academy of Sciences of the USSR, 41(4):333-338, 1987). URL: https://doi.org/10.1007/BF01137685.
  17. Roman Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 77-82. ACM, 1987. Google Scholar
  18. Roman Smolensky. Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 77-82, 1987. Google Scholar
  19. Roman Smolensky. On representations by low-degree polynomials. In Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pages 130-138. IEEE, 1993. Google Scholar
  20. Roman Smolensky. On Representations by Low-Degree Polynomials. In FOCS, pages 130-138, 1993. URL: https://doi.org/10.1109/SFCS.1993.366874.
  21. Srikanth Srinivasan, Utkarsh Tripathi, and S. Venkitesh. On the Probabilistic Degrees of Symmetric Boolean functions. Electronic Colloquium on Computational Complexity (ECCC), 138:1-24, 2019. URL: https://eccc.weizmann.ac.il/report/2019/138.
  22. Jun Tarui. Probabilistic Polynomials, AC⁰ Functions, and the Polynomial-Time Hierarchy. Theoretical Computer Science, 113(1):167-183, 1993. Google Scholar
  23. Richard Ryan Williams. The polynomial method in circuit complexity applied to algorithm design (invited talk). In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2014. Google Scholar
  24. Zhi-Li Zhang, David A Mix Barrington, and Jun Tarui. Computing symmetric functions with AND/OR circuits and a single MAJORITY gate. In Annual Symposium on Theoretical Aspects of Computer Science, pages 535-544. Springer, 1993. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact