Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On bounds for complexity of circuits of multi-input functional elements
-
N. P. Redkin
Veröffentlicht/Copyright:
18. März 2010
Abstract
In this paper we suggest a method to find lower bounds for complexity of circuits of functional elements. The essence of the method consists of replacing the initial, maybe quite complex, basis containing multi-input elements by a more simple basis, say, of two-input elements, with subsequent use of known lower bounds for complexity of circuits in the simple basis. The efficiency of this method is illustrated on particular examples of finding the asymptotics and even precise values of complexities of realisation of special Boolean functions, monotone Boolean functions and functions with small number of ones.
Received: 2009-06-08
Revised: 2009-12-16
Published Online: 2010-03-18
Published in Print: 2010-March
© de Gruyter 2010
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On approximation of continuous functions by determinate functions with delay
- Fast algorithms for elementary operations on complex power series
- On the complexity of the ℰ2 Grzegorczyk class
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On bounds for complexity of circuits of multi-input functional elements
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
- On the finite near-rings generated by endomorphisms of an extra-special 2-group
Artikel in diesem Heft
- On approximation of continuous functions by determinate functions with delay
- Fast algorithms for elementary operations on complex power series
- On the complexity of the ℰ2 Grzegorczyk class
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On bounds for complexity of circuits of multi-input functional elements
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
- On the finite near-rings generated by endomorphisms of an extra-special 2-group
