Top-Down Lower Bounds for Depth 3 Circuits
نویسندگان
چکیده
We present a top-down lower bound method for depth 3 AND-OR-NOT circuits which is simpler than the previous methods and in some cases gives better lower bounds. In particular we prove that depth 3 AND-OR-NOT circuits that compute PARITY resp. MAJORITY require size a t least 20.6 18.. fi resp. 2°.849...fi. This is the first simple proof of a strong lower bound by a top-down argument for non-monotone circuits.
منابع مشابه
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree n in n variables such that any homogeneous depth 4 arithmetic circuit computing it must have size n . Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gup...
متن کاملA Depth 3 Circuit Lower Bound for the Parity Function
The goal of computational complexity is to measure the amount of resources needed to perform certain computations. There has been great progress in finding upper bounds (algorithms) for many problems. However, it is still very difficult to find lower bounds for problems over general computational models, such as Turing machine or the circuit model with a complete basis. Many key open problems i...
متن کاملAffine Projections of Symmetric Polynomials
In this paper we introduce a new model for computing polynomials a depth 2 circuit with a symmetric gate at the top and plus gates at the bottom, i.e the circuit computes a symmetric function in linear functions Sd m(`1; `2; :::; `m) (Sd m is the d’th elementary symmetric polynomial in m variables, and the `i’s are linear functions). We refer to this model as the symmetric model. This new model...
متن کاملPrediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds
Consider a random sequence of n bits that has entropy at least n − k, where k n. A commonly used observation is that an average coordinate of this random sequence is close to being uniformly distributed, that is, the coordinate “looks random”. In this work, we prove a stronger result that says, roughly, that the average coordinate looks random to an adversary that is allowed to query ≈ nk other...
متن کاملA Non-Probabilistic Switching Lemma for the Sipser Function
Abs t r ac t . Valiant [12] showed that the clique function is structurally different than the majority function by establishing the following "switching lemma ~ : Any function f whose set of prime implicants is a large enough subset of the set of cliques (and thus requiring big ~2-circuits), has a large set of prime clauses (i.e., big II2-circuits). As a corollary, an exponential lower bound w...
متن کامل