The Coin Problem in Constant Depth: Sample Complexity and Parity Gates

09/11/2018
by   Nutan Limaye, et al.
0

The δ-Coin Problem is the computational problem of distinguishing between coins that are heads with probability (1+δ)/2 or (1-δ)/2, where δ is a parameter tending to 0. We study this problem's complexity in the model of constant-depth Boolean circuits and prove the following results. Upper bounds. For any constant d≥ 2, we show that there are explicit monotone AC^0 formulas (i.e. made up of AND and OR gates only) solving the δ-coin problem, having depth d, size (O(d(1/δ)^1/(d-1))), and sample complexity (no. of inputs) poly(1/δ). This matches previous upper bounds of O'Donnell and Wimmer (ICALP 2007) and Amano (ICALP 2009) in terms of size (which is optimal) and improves the sample complexity from (O(d(1/δ)^1/(d-1))) to poly(1/δ). Lower bounds. We show that the above upper bounds are nearly tight even for the significantly stronger model of AC^0[⊕] formulas (i.e. allowing NOT and Parity gates): formally, we show that any AC^0[⊕] formula solving the δ-coin problem must have size (Ω(d(1/δ)^1/(d-1))). This strengthens a result of Cohen, Ganor and Raz (APPROX-RANDOM 2014), who prove a similar result for AC^0, and a result of Shaltiel and Viola (SICOMP 2010), which implies a superpolynomially weaker (still exponential) lower bound. The above yields the first class of explicit functions where we have nearly (up to a polynomial factor) matching upper and lower bounds for the class of AC^0[⊕] formulas. In particular, this yields the first Fixed-depth Size-Hierarchy Theorem for the uniform version of this class: our results imply that for any fixed d, the class C_d,k of functions that have uniform AC^0[⊕] formulas of depth d and size n^k form an infinite hierarchy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/11/2018

A Fixed-Depth Size-Hierarchy Theorem for AC^0[⊕] via the Coin Problem

We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC^0[⊕...
research
05/20/2022

Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search

Greedy best-first search (GBFS) and A* search (A*) are popular algorithm...
research
08/17/2020

Bounds on the QAC^0 Complexity of Approximating Parity

QAC circuits are quantum circuits with one-qubit gates and Toffoli gates...
research
09/15/2017

The Orthogonal Vectors Conjecture for Branching Programs and Formulas

In the Orthogonal Vectors (OV) problem, we wish to determine if there is...
research
03/14/2021

Sharp indistinguishability bounds from non-uniform approximations

We study the problem of distinguishing between two symmetric probability...
research
01/07/2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

We significantly strengthen and generalize the theorem lifting Nullstell...
research
01/03/2019

Nearly optimal lattice simulation by product formulas

Product formulas provide a straightforward yet surprisingly efficient ap...

Please sign up or login with your details

Forgot password? Click here to reset