On the limits of gate elimination
- 1 September 2018
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 96, 107-119
Abstract
No abstract availableKeywords
Funding Information
- Government of the Russian Federation (14.Z50.31.0030)
This publication has 15 references indexed in Scilit:
- Affine Dispersers from Subspace PolynomialsSIAM Journal on Computing, 2012
- A well-mixed function with circuit complexity : Tightness of the Lachish–Raz-type boundsTheoretical Computer Science, 2011
- On convex complexity measuresTheoretical Computer Science, 2010
- New upper bounds on the Boolean circuit complexity of symmetric functionsInformation Processing Letters, 2010
- AlgebrizationACM Transactions on Computation Theory, 2009
- Linear-Time Encodable/Decodable Codes With Near-Optimal RateIEEE Transactions on Information Theory, 2005
- Lower Bounds on Formula Size of Boolean Functions Using Hypergraph EntropySIAM Journal on Discrete Mathematics, 1995
- A Boolean function requiring 3n network sizeTheoretical Computer Science, 1983
- On the combinational complexity of certain symmetric Boolean functionsTheory of Computing Systems, 1976
- Method of determining lower bounds for the complexity of P-schemesMathematical Notes, 1971