Weak Bounded Arithmetic and Boolean Circuit Complexity
نویسنده
چکیده
منابع مشابه
Approximate counting in bounded arithmetic
We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV )), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP , APP , MA, AM ) in PV1 + dWPHP(PV ).
متن کاملWeak length induction and slow growing depth boolean circuits
We de ne a hierarchy of circuit complexity classes LD , whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction called LIND and construct a bounded arithmetic theory L2 whose provably total functions exactly corresponds to functions computable by LD circuits. Finally, we prove a non-conservation result between L2 and a weak...
متن کاملDual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x2 . We propose a natural framework for formalization of randomized algorithms in bounded arithmetic, and use it to provide a strengthening of Wilkie’s witnessing theorem for S 2+dWPHP(PV ). We construct a propositional proof system WF (bas...
متن کاملSmall space analogues of Valiant's classes and the limitations of skew formula
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relationship in Valiant’s algebraic model of computation, we propose width of an arithmetic circuit as a possible measure of space. We introduce the class VL as an algebraic variant of deterministic log-space L. In the uniform s...
متن کاملFunctional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity
We say that a circuit C over a field F functionally computes an n-variate polynomial P ∈ F[x1, x2, . . . , xn] if for every x ∈ {0, 1}n we have that C(x) = P(x). This is in contrast to syntactically computing P, when C ≡ P as formal polynomials. In this paper, we study the question of proving lower bounds for homogeneous depth-3 and depth-4 arithmetic circuits for functional computation. We pro...
متن کامل