Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\) (Q1869604)
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: Range estimation is NP-hard for ^2 accuracy and feasible for ^2- |
scientific article; zbMATH DE number 1902316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\) |
scientific article; zbMATH DE number 1902316 |
Statements
Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\) (English)
0 references
28 April 2003
0 references
interval compulations
0 references
NP-hard
0 references
complexity
0 references
asymptotic range estimation
0 references
algorithm
0 references
0.8842325210571289
0 references
0.8469588160514832
0 references
0.8204952478408813
0 references
