Formula Complexity of Ternary Majorities
نویسنده
چکیده
It is known that any self-dual Boolean function can be decomposed into compositions of 3-bit majority functions. In this paper, we define a notion of a ternary majority formula, which is a ternary tree composed of nodes labeled by 3-bit majority functions and leaves labeled by literals. We study their complexity in terms of formula size. In particular, we prove upper and lower bounds for ternary majority formula size of several Boolean functions. To devise a general method to prove the ternary majority formula size lower bounds, we give an upper bound for the largest separation between ternary majority formula size and DeMorgan formula size.
منابع مشابه
An Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملSeparation of AC0[⊕] Formulas and Circuits
This paper gives the first separation between the power of formulas and circuits of equal depth in the AC0[⊕] basis (unbounded fan-in AND, OR, NOT and MOD2 gates). We show, for all d(n) ≤ O( logn log logn ), that there exist polynomial-size depth-d circuits that are not equivalent to depth-d formulas of size no(d) (moreover, this is optimal in that no(d) cannot be improved to nO(d)). This resul...
متن کاملAnalogue of Sylvester-cayley Formula for Invariants of Ternary Form
The number ν d (n) of linearly independed homogeneous invariants of degree n for the ternary form of degree d is calculated. The folloving formula is hold is number of nonnegative integer solutions of the system of equations
متن کاملFrom Binary Logic Functions to Fuzzy Logic Functions
It is known that any binary logic function (in binary logic) can be represented by at least one logic formula, however this is not always true for a ternary logic function (in ternary logic). A ternary logic function can be represented by at least one logic formula if and only if it satisfies a mathematical condition which is called regularity. Also, it is known that a fuzzy logic formula (in s...
متن کاملOn Expressing Majority as a Majority of Majorities
If k < n, can one express the majority of n bits as the majority of at most k majorities, each of at most k bits? We prove that such an expression is possible only if k & n = n. This improves on a bound proved by Kulikov and Podolskii [KP17], who showed that k & n. Our proof is based on ideas originating in discrepancy theory, as well as a strong concentration bound for sums of independent Bern...
متن کامل