Complexity and depth of formulas for symmetric Boolean functions
From MaRDI portal
Publication:334301
DOI10.3103/S0027132216030098zbMATH Open1353.94095MaRDI QIDQ334301FDOQ334301
Authors: I. S. Sergeev 
Publication date: 1 November 2016
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Recommendations
- Upper bounds on the depth of symmetric Boolean functions
- Upper bounds for the formula size of symmetric Boolean functions
- scientific article; zbMATH DE number 3968581
- New upper bounds on the Boolean circuit complexity of symmetric functions
- Upper bounds on the multiplicative complexity of symmetric Boolean functions
Cites Work
- Upper bounds on the depth of symmetric Boolean functions
- Short monotone formulae for the majority function
- The complexity of the realization of symmetrical functions by formulae
- Efficient oblivious branching programs for threshold and mod functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper bounds for the formula size of symmetric Boolean functions
Cited In (8)
- Upper bounds on the depth of symmetric Boolean functions
- Formula complexity of a linear function in a \(k\)-ary basis
- Title not available (Why is that?)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority
- Upper bounds for the formula size of symmetric Boolean functions
- Multiplication
- Title not available (Why is that?)
- On the meaning of works by V. M. Khrapchenko
This page was built for publication: Complexity and depth of formulas for symmetric Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334301)
