Complexity of implementation of parity functions in the ``implication-negation'' basis (Q2820943)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of implementation of parity functions in the ``implication-negation basis |
scientific article; zbMATH DE number 6626606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of implementation of parity functions in the ``implication-negation'' basis |
scientific article; zbMATH DE number 6626606 |
Statements
13 September 2016
0 references
circuit
0 references
parity function
0 references
minimal circuit
0 references
complexity circuits
0 references
0.90584624
0 references
0.89778244
0 references
0.8898425
0 references
0.8898425
0 references
0.87600875
0 references
0.87579155
0 references
0 references
0.8706758
0 references
0.8699675
0 references
Complexity of implementation of parity functions in the ``implication-negation'' basis (English)
0 references
