Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
From MaRDI portal
Publication:4721956
DOI10.1137/0215047zbMath0613.94011OpenAlexW1977452695MaRDI QIDQ4721956
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215047
Related Items (6)
The graph clustering problem has a perfect zero-knowledge interactive proof ⋮ How to Share a Secret, Infinitely ⋮ Construction of universal enumerators and formulas for threshold functions ⋮ ERCW PRAMs and optical communication ⋮ Using amplification to compute majority with small majority gates ⋮ The conjunctive complexity of quadratic Boolean functions
This page was built for publication: Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables