Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions

@inproceedings{Sherstov2008ApproximateIF,
  title={Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions},
  author={Alexander A. Sherstov},
  booktitle={Computational Complexity Conference},
  year={2008}
}
Let A_1,..., A_n be events in a probability space. The approximate inclusion-exclusion problem, due to Linial and Nisan (1990), is to estimate Prob [A_1 OR ... OR A_n] given Prob [AND_{i in S} A_i] for |S|{0,1} is a given symmetric function. (In the Linial-Nisan problem, f=OR.). We solve this general problem for every f and k, giving an algorithm that runs in polynomial time and achieves an approximation error that is essentially optimal. We prove this optimal error to be 2^{- tilde Theta(k^2/n… 
The Pattern Matrix Method (Journal Version)
TLDR
A new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmetric predicates is given, and the discrepancy, approximate rank, and approximate trace norm of A_f are characterized in terms of well-studied analytic properties of f.
The Pattern Matrix Method
TLDR
The pattern matrix method gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmetric predicates, and characterize the discrepancy, approximate rank, and approximate trace norm of A_f in terms of well-studied analytic properties of f.
Approximating the AND-OR Tree
TLDR
It is proved that the function V n i=1 W n j=1 xi j, known as the AND-OR tree, has approximate degree W(n), which is tight and closes a line of research on the problem.
Strong direct product theorems for quantum communication and query complexity
TLDR
This work proves that quantum communication complexity obeys an SDPT whenever the communication lower bound for a single instance is proved by the generalized discrepancy method, the strongest technique in that model.

References

SHOWING 1-10 OF 28 REFERENCES
The Unbounded-Error Communication Complexity of Symmetric Functions
  • Alexander A. Sherstov
  • Computer Science, Mathematics
    2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • 2008
TLDR
It is shown that a given predicate D gives rise to a rapidly mixing random walk on Z2 n, which allows the problem to be reduced to communication lower bounds for typical predicates, and Paturi's approximation lower bounds are used to prove that a typical predicate behaves analogous to PARITY with respect to a smooth distribution on the inputs.
The expressive power of voting polynomials
TLDR
The first correct proof that, for a random oracleA, PP A is properly contained in PSPACE A is given, and a new lower bound technique which applies to any Boolean function is introduced which yields tight bounds in the casef is parity.
The pattern matrix method for lower bounds on quantum communication
TLDR
An entirely different proof of Razborov's result is given, using the original, one-dimensional discrepancy method, which refutes the commonly held intuition that the original discrepancy method fails for functions such as DISJOINTNESS and establishes a large new class of total Boolean functions whose quantum communication complexity is at best polynomially smaller than their classical complexity.
Quantum lower bounds by polynomials
TLDR
This work examines the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.
Quantum communication complexity of block-composed functions
TLDR
A lower-bound method is developed that does not require symmetry and proves the conjectured negative answer for functions F of the following form: F(x, y) = fn(x1, y1, x2, y2, ..., xn, yn), where fn is a symmetric Booleanfunction on n Boolean inputs, and xi, yi are the i'th bit of x and y, respectively.
A Lower Bound for Agnostically Learning Disjunctions
TLDR
These lower bounds substantially strengthen and generalize the polynomial approximation lower bounds of Paturi and show that the regression-based agnostic learning algorithm of Kalai et al. is optimal.
A Discrepancy-Based Proof of Razborov ’ s Quantum Lower Bounds
In a breakthrough result, Razborov (2003) gave optimal lower bounds on the quantum communication complexity Q1/3( f ) of every function f (x, y) = D(|x ∧ y|), where D : {0, 1, . . . , n} → {0, 1}.
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
  • R. D. Wolf
  • Computer Science
    Quantum Inf. Comput.
  • 2008
TLDR
This note shows how a tighter version of dege(f), without thelog-factors hidden in the Θ-notation, can be derived quite easily using the close connection between polynomials and quantum algorithms.
Bounds for small-error and zero-error quantum algorithms
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the
Quantum lower bounds for the collision and the element distinctness problems
TLDR
These lower bounds provide evidence for the existence of cryptographic primitives that are immune to quantum cryptanalysis, and implies a quantum lower bound of Ω(<i>n</i><sup>2/3</sup>) queries for the element distinctness problem, which is to determine whether <i*n> integers are all distinct.
...
...