Complexity and depth of formulas for symmetric Boolean functions
From MaRDI portal
Publication:334301
DOI10.3103/S0027132216030098zbMath1353.94095MaRDI QIDQ334301
Publication date: 1 November 2016
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Related Items
ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO, Formula complexity of a linear function in a \(k\)-ary basis, Cubic Formula Size Lower Bounds Based on Compositions with Majority, Unnamed Item
Cites Work
- Upper bounds on the depth of symmetric Boolean functions
- Upper bounds for the formula size of symmetric Boolean functions
- The complexity of the realization of symmetrical functions by formulae
- Efficient oblivious branching programs for threshold and mod functions
- Short monotone formulae for the majority function
- Unnamed Item
- Unnamed Item