Computing majority with low-fan-in majority queries

Gleb Posobin

Home/Archive/arXiv

arXiv · 1711.10176

Computing majority with low-fan-in majority queries

Gleb Posobin

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we examine the problem of computing majority function $\mathrm{MAJ}_n$ on $n$ bits by depth-two formula, where each gate is a majority function on at most $k$ inputs. We present such formula that gives the first nontrivial upper bound for this problem, with $k = \frac{2}{3} n + 4$. This answers an open question in [Kulikov, Podolskii, 2017]. We also look at this problem in adaptive setting - when we are allowed to query for value of $\mathrm{MAJ}_k$ on any subset, and wish to minimize the number of such queries. We give a simple lower bound for this setting with $\lceil n/k \rceil$ queries, and we present two algorithms for this model: the first one makes $\approx 2\frac{n}{k} \log k$ queries in the case when we are limited to the standard majority functions, and the second one makes $\frac{n}{k} \log k$ queries when we are allowed to change the threshold of majority function.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Gleb Posobin. 2017-11-28. Computing majority with low-fan-in majority queries. https://arxiv.org/abs/1711.10176

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗