AND and/or OR: Uniform Polynomial-Size Circuits
نویسندگان
چکیده
منابع مشابه
AND and/or OR: Uniform Polynomial-Size Circuits
We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant 0/1 gates. As is the norm for Boolean circuits, our circuits have multiple sink gates, which implies that an OR circuit computes an OR function on some subset of its input...
متن کاملDefinability by Constant-Depth Polynomial-Size Circuits
A function of boolean arguments is symmetric if its value depends solely on the number of l 's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constant-depth polynomial-size sequences of boolean circuits, and discuss the complete characterization. (We treat both uniform and non-uniform sequences of circuits.) Our r...
متن کاملCompleteness and Weak Completeness Under Polynomial-Size Circuits
This paper investigates the distribution and nonuniform complexity of problems that are com plete or weakly complete for ESPACE under nonuniform reductions that are computed by polynomial size circuits P Poly Turing reductions and P Poly many one reductions A tight exponential lower bound on the space bounded Kolmogorov complexities of weakly P Poly Turing complete problems is established A Sma...
متن کاملBounded-Depth, Polynomial-Size Circuits for Symmetric Functions
Let ~:= {f~,f2 . . . . } be a family of symmetric Boolean functions, where fn has n Boolean variables, for each n I> 1. L e t / ~ ( n ) be the minimum number of variables offn that each have to be set to constant values so that the resulting function is a constant function. We show that the growth rate o f / ~ ( n ) completely determines whether or not the family ~: is 'good', that is, can be r...
متن کاملIf NP has Polynomial-Size Circuits, then MA=AM
It is shown that the assumption of NP having polynomial size circuits implies apart from a collapse of the polynomial time hierarchy as shown by Karp and Lip ton that the classes AM and MA of Babai s Arthur Merlin hierarchy coincide This means that also a certain inner collapse of the remaining classes of the polynomial time hierarchy occurs It is well known KL that the assumption of NP having ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.128.20