New upper bounds on the Boolean circuit complexity of symmetric functions
Information Processing Letters2010Vol. 110(7), pp. 264–267
Citations Over TimeTop 10% of 2010 papers
Related Papers
- → Non-cancellative Boolean circuits: A generalization of monotone boolean circuits(2000)1 cited
- → The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates(2007)3 cited
- → Reductions for Monotone Boolean Circuits(2006)
- Lower Bounds for the Complexity of Restrictions of Boolean Functions(2001)