Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates

We study the following computational problem: for which values of k , the majority of n bits MAJ n can be computed with a depth two formula whose each gate computes a majority function of at most k bits? The corresponding computational model is denoted by MAJ k ∘ MAJ k . We observe that the minimum...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2019-07, Vol.63 (5), p.956-986
Hauptverfasser:	Kulikov, Alexander S., Podolskii, Vladimir V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuits Computation Computer Science Lower bounds Special Issue on Theoretical Aspects of Computer Science (STACS 2017) Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!