Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
A simplified proof of a lower complexity estimate
-
V. M. Khrapchenko
Veröffentlicht/Copyright:
5. Dezember 2013
Abstract
- The proof of a well-known inequality which may be used to derive quadratic lower bounds for the complexity of Π-circuits (or, the same, formulae over the basis {&,V-}) for many Boolean functions is significantly simplified.
This work was financially supported by the Program of Fundamental Research “Algebraic and Combinatorial Methods of Mathematical Cybernetics” of the Mathematical Sciences Department of the Russian Academy of Sciences (project “Synthesis and Complexity of Control Systems”).
References
Published Online: 2013-12-05
Published in Print: 2013-12
© 2013 by Walter de Gruyter GmbH & Co.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Masthead
- On the solvability of the equational theory of commutative medial n-ary groupoids
- Estimating the stability radius of the vector MAX-CUT problem
- Statistical estimation of parameters for binary Markov chain models with embeddings
- A simplified proof of a lower complexity estimate
- Finite groups with nilpotent and Hall subgroups
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- The number of differences in groups of prime order
- Characteristic submodules of injective modules
- On transformations of probability distributions by read-once quasigroup formulae
Artikel in diesem Heft
- Masthead
- On the solvability of the equational theory of commutative medial n-ary groupoids
- Estimating the stability radius of the vector MAX-CUT problem
- Statistical estimation of parameters for binary Markov chain models with embeddings
- A simplified proof of a lower complexity estimate
- Finite groups with nilpotent and Hall subgroups
- Implementing the multiplication of polynomial matrices over the field GF(2) by means of the fast Fourier transform
- The number of differences in groups of prime order
- Characteristic submodules of injective modules
- On transformations of probability distributions by read-once quasigroup formulae
