Worst case complexity of problems with random information noise (Q2365416)
From MaRDI portal
!
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 975830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case complexity of problems with random information noise |
scientific article; zbMATH DE number 975830 |
Statements
Worst case complexity of problems with random information noise (English)
0 references
26 May 1997
0 references
worst case complexity
0 references
solving problems
0 references
0.8425933122634888
0 references
0.8296971917152405
0 references
0.8207155466079712
0 references
0.7898148894309998
0 references
