On Circuit Complexity of Parity and Majority Functions in Antichain Basis
نویسنده
چکیده
We study the circuit complexity of boolean functions in a certain infinite basis. The basis consists of all functions that take value 1 on antichains over the boolean cube. We prove that the circuit complexity of the parity function and the majority function of n variables in this basis is b 2 c and ⌊ n 2 ⌋ +1 respectively. We show that the asymptotic of the maximum complexity of n-variable boolean functions in this basis equals n.
منابع مشابه
Lecture 11 : Circuit Lower
There are specific kinds of circuits for which lower bounds techniques were successfully developed. One is small-depth circuits, the other is monotone circuits. For constant-depth circuits with AND,OR,NOT gates, people proved that they cannot compute simple functions like PARITY [3, 1] or MAJORITY. For monotone circuits, Alexander A. Razborov proved that CLIQUE, an NP-complete problem, has expo...
متن کاملA new circuit model for the Parameters in equations of low power Hodgkin-Huxley neuron cell
In this paper, α and β parameters and gating variables equations of Hodgkin-Huxley neuron cell have been studied. Gating variables show opening and closing rate of ion flow of calcium and potassium in neuron cell. Variable functions α and β, are exponential functions in terms of u potential that have been obtained by Hodgkin and Huxley experimentally to adjust the equations of neural cells. In ...
متن کامل2 Monotone Functions and Monotone Circuits
In the last lecture we looked at lower bounds for constant-depth circuits, proving that PARITY cannot be computed by constant-depth circuits, i.e. PARITY / ∈ AC0. General circuit lower bounds for explicit functions are quite weak: the best we can prove after years of effort is that there is a function, which requires circuits of size 5n − o(n). In this lecture we will examine what happens if we...
متن کاملLecture 5: Razborov-Smolensky Lower Bounds for Constant-Depth Circuit with MODp Gates
In this lecture, we will talk about circuit lower bound for constant-depth circuit with MODp gates. Using switching lemma, we can prove exponential size lower bound for constant-depth circuit computing parity and majority. What if parity (=MOD2 gates) are allowed? It was conjectured that majority still needs exponential size to compute in constant-depth circuit. Razborov (1987) solves this conj...
متن کاملA Duality Between Depth-Three Formulas and Approximation by Depth-Two
We establish an explicit link between depth-3 formulas and one-sided-error approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n) equal to the inverse of the maximum, over all depth-2 formulas, of one-sided-error correlation bound divided by the size of the depth-2 formula, on a cer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.2456 شماره
صفحات -
تاریخ انتشار 2014