The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5221854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the descriptiveness of Boolean circuits over different sets of gates |
scientific article; zbMATH DE number 5221854 |
Statements
The complexity of the descriptiveness of Boolean circuits over different sets of gates (English)
0 references
19 December 2007
0 references
Boolean function
0 references
0.90175027
0 references
0.89783025
0 references
0.89659196
0 references
0.89021707
0 references
0 references
