Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Lower Bounding the AND-OR Tree via Symmetrization

Lower Bounding the AND-OR Tree via Symmetrization We prove a simple, nearly tight lower bound on the approximate degree of the two-level AND-OR tree using symmetrization arguments. Specifically, we show that deg(ANDm ORn) = (√mn). We prove this lower bound via reduction to the OR function through a series of symmetrization steps, in contrast to most other proofs that involve formulating approximate degree as a linear program [6, 10, 21]. Our proof also demonstrates the power of a symmetrization technique involving Laurent polynomials (polynomials with negative exponents) that was previously introduced by Aaronson et al. [2]. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computation Theory (TOCT) Association for Computing Machinery

Lower Bounding the AND-OR Tree via Symmetrization

Download PDF
11 pages

Loading next page...
 
/lp/association-for-computing-machinery/lower-bounding-the-and-or-tree-via-symmetrization-Cy1O3ENo0K

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2021 ACM
ISSN
1942-3454
eISSN
1942-3462
DOI
10.1145/3434385
Publisher site
See Article on Publisher Site

Abstract

We prove a simple, nearly tight lower bound on the approximate degree of the two-level AND-OR tree using symmetrization arguments. Specifically, we show that deg(ANDm ORn) = (√mn). We prove this lower bound via reduction to the OR function through a series of symmetrization steps, in contrast to most other proofs that involve formulating approximate degree as a linear program [6, 10, 21]. Our proof also demonstrates the power of a symmetrization technique involving Laurent polynomials (polynomials with negative exponents) that was previously introduced by Aaronson et al. [2].

Journal

ACM Transactions on Computation Theory (TOCT) – Association for Computing Machinery

Published: Jan 21, 2021

Keywords: AND-OR tree

References

  • The polynomial method in quantum and classical computing
    Aaronson, Scott
  • Quantum lower bounds for approximate counting via Laurent polynomials
    Aaronson, Scott; Kothari, Robin; Kretschmer, William; Thaler, Justin
  • Quantum lower bounds by quantum arguments
    Ambainis, Andris
  • Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range
    Ambainis, Andris
  • Quantum lower bounds by polynomials
    Beals, Robert; Buhrman, Harry; Cleve, Richard; Mosca, Michele; de Wolf, Ronald
  • Classical lower bounds from quantum upper bounds
    Ben-David, Shalev; Bouland, Adam; Garg, Ankit; Kothari, Robin
  • Quantum vs
    Buhrman, Harry; Cleve, Richard; Wigderson, Avi
  • Complexity measures and decision tree complexity: a survey
    Buhrman, Harry; de Wolf, Ronald
  • The polynomial method strikes back: Tight quantum query bounds via dual polynomials
    Bun, Mark; Kothari, Robin; Thaler, Justin
  • Dual lower bounds for approximate degree and Markov-Bernstein inequalities
    Bun, Mark; Thaler, Justin
  • Dual polynomials for collision and element distinctness
    Bun, Mark; Thaler, Justin
  • A fast quantum mechanical algorithm for database search
    Grover, Lov K.
  • Quantum search on bounded-error inputs
    Høyer, Peter; Mosca, Michele; de Wolf, Ronald
  • Perceptrons: An Introduction to Computational Geometry
    Minsky, Marvin; Papert, Seymour
  • On the degree of Boolean functions as real polynomials
    Nisan, Noam; Szegedy, Mario
  • On the degree of polynomials that approximate symmetric Boolean functions
    Paturi, Ramamohan
  • Probabilistic Boolean decision trees and the complexity of evaluating game trees
    Saks, Michael; Wigderson, Avi
  • The intersection of two halfspaces has high threshold degree
    Sherstov, Alexander A.
  • Strong direct product theorems for quantum communication and query complexity
    Sherstov, Alexander A.
  • Making polynomials robust to noise
    Sherstov, Alexander A.
  • Approximating the AND-OR tree
    Sherstov, Alexander A.
  • Near-optimal lower bounds on the threshold degree and sign-rank of AC0
    Sherstov, Alexander A.; Wu, Pei
  • Approximating linear restrictions of Boolean functions
    Shi, Yaoyun