Average-Case Lower Bounds for Noisy Boolean Decision Trees (Q4210156)
From MaRDI portal
!
WARNING
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 1200796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-Case Lower Bounds for Noisy Boolean Decision Trees |
scientific article; zbMATH DE number 1200796 |
Statements
Average-Case Lower Bounds for Noisy Boolean Decision Trees (English)
0 references
21 September 1998
0 references
fault-tolerance
0 references
reliability
0 references
noisy computation
0 references
error-correction
0 references
0.9216076135635376
0 references
0.8178315162658691
0 references
0.7863357663154602
0 references
0.7862796783447266
0 references
0.7854318022727966
0 references
