Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In

The paper is focused on the implementation of parity functions by circuits in the basis . This basis consists of all gates that implement functions of the form . It is proved that every circuit in implementing a parity function of variables contains at least gates.

Uloženo v:
Podrobná bibliografie
Vydáno v:Moscow University mathematics bulletin Ročník 76; číslo 6; s. 266 - 270
Hlavní autor: Kombarov, Yu. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.12.2021
Springer Nature B.V
Témata:
Analysis
Gates (circuits)
Lower bounds
Mathematical analysis
Mathematics
Mathematics and Statistics
Parity
circuit complexity
parity function
minimal circuit
Boolean circuits
ISSN:0027-1322, 1934-8444
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper is focused on the implementation of parity functions by circuits in the basis . This basis consists of all gates that implement functions of the form . It is proved that every circuit in implementing a parity function of variables contains at least gates.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0027-1322
1934-8444
DOI:10.3103/S002713222106005X