On the complexity of the evaluation of transient extensions of Boolean functions (Q2909178)
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 6073929
| 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 6073929 |
Statements
30 August 2012
0 references
algebra
0 references
Boolean function
0 references
circuit
0 references
complexity
0 references
evaluation
0 references
gate
0 references
hazard
0 references
multi-valued
0 references
transient
0 references
transient extension
0 references
1.0000002
0 references
0.8963729
0 references
0.8920224
0 references
0.88896686
0 references
0.88710934
0 references
0.8841623
0 references
0.88371104
0 references
0.88311744
0 references
On the complexity of the evaluation of transient extensions of Boolean functions (English)
0 references
