Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements

The paper is focused on realization of parity functions by circuits in the basis U ∞ . This basis contains all functions of the form . A method of construction of circuits for a parity function of n variables with the complexity is described. This improves the previously known upper bound of U ∞ -co...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Moscow University mathematics bulletin Ročník 70; číslo 5; s. 226 - 229
Hlavný autor: Kombarov, Yu. A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Allerton Press 01.09.2015
Predmet:
Analysis
Brief Communications
Mathematics
Mathematics and Statistics
Parity Function
Linear Function
Realization Complexity
ISSN:0027-1322, 1934-8444
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The paper is focused on realization of parity functions by circuits in the basis U ∞ . This basis contains all functions of the form . A method of construction of circuits for a parity function of n variables with the complexity is described. This improves the previously known upper bound of U ∞ -complexity of parity functions that was . The minimality of constructed circuits is verified for very small n (for n < 7).
ISSN:0027-1322
1934-8444
DOI:10.3103/S0027132215050083