Estimating the range of a polynomial on an interval with relative accuracy \(\varepsilon\) is NP-hard for \(\varepsilon\leqslant 1\) and feasible for \(\varepsilon> 1\) (Q6897006)
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 8124521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating the range of a polynomial on an interval with relative accuracy \(\varepsilon\) is NP-hard for \(\varepsilon\leqslant 1\) and feasible for \(\varepsilon> 1\) |
scientific article; zbMATH DE number 8124521 |
Statements
Estimating the range of a polynomial on an interval with relative accuracy \(\varepsilon\) is NP-hard for \(\varepsilon\leqslant 1\) and feasible for \(\varepsilon> 1\) (English)
0 references
20 November 2025
0 references
range of a polynomial
0 references
NP-hard problem
0 references
feasible problem
0 references
Gaganov theorem
0 references
