On the complexity of worst case and expected time in a circuit (Q4593940)
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 worst case and expected time in a circuit |
scientific article; zbMATH DE number 6807563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of worst case and expected time in a circuit |
scientific article; zbMATH DE number 6807563 |
Statements
On the complexity of worst case and expected time in a circuit (English)
0 references
16 November 2017
0 references
theory of parallel and distributed computation
0 references
computational complexity
0 references
average-case analysis
0 references
expected time
0 references
worst case
0 references
timed circuits
0 references
0.8511803150177002
0 references
0.8509032726287842
0 references
0.8301888704299927
0 references
0.7545347809791565
0 references
0.7417382597923279
0 references
