The complexity of the representation of multiple-output Boolean functions (Q332335)
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: The complexity of the representation of multiple-output Boolean functions |
scientific article; zbMATH DE number 6648824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the representation of multiple-output Boolean functions |
scientific article; zbMATH DE number 6648824 |
Statements
The complexity of the representation of multiple-output Boolean functions (English)
0 references
8 November 2016
0 references
Boolean function
0 references
Shannon function
0 references
complexity
0 references
Toffoli gates
0 references
reversible circuits
0 references
Reed-Muller forms
0 references
0 references
0.8245012164115906
0 references
0.7974992394447327
0 references
0.7949777841567993
0 references
0.7943838238716125
0 references
