Tighter Relations between Sensitivity and Other Complexity Measures
Lecture notes in computer science2014pp. 101–113
Citations Over TimeTop 10% of 2014 papers
Related Papers
- → New upper bounds on the Boolean circuit complexity of symmetric functions(2010)30 cited
- The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions.(2006)
- Lower Bounds for the Complexity of Restrictions of Boolean Functions(2001)
- → On the complexity of monotone circuits for threshold symmetric Boolean functions(2021)