On the complexity of the evaluation of transient extensions of Boolean functions (Q4964007)
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 of the evaluation of transient extensions of Boolean functions |
scientific article; zbMATH DE number 7315088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the evaluation of transient extensions of Boolean functions |
scientific article; zbMATH DE number 7315088 |
Statements
24 February 2021
0 references
transient algebra
0 references
Boolean function
0 references
circuit
0 references
complexity
0 references
evaluation
0 references
gate
0 references
hazard
0 references
multi-valued algebra
0 references
transient extension
0 references
0.9973338842391968
0 references
0.7685470581054688
0 references
0.7476129531860352
0 references
