On the complexity and depth of circuits that realize partial Boolean functions (Q4367622)
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: On the complexity and depth of circuits that realize partial Boolean functions |
scientific article; zbMATH DE number 1092777
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity and depth of circuits that realize partial Boolean functions |
scientific article; zbMATH DE number 1092777 |
Statements
On the complexity and depth of circuits that realize partial Boolean functions (English)
0 references
28 January 1998
0 references
partial Boolean functions
0 references
circuits
0 references
depth
0 references
complexity
0 references
0.7785733938217163
0 references
0.7769018411636353
0 references
0.7704594731330872
0 references
