On optimal polynomial time approximations: P-levelability vs. δ-levelability (Q4645194)
From MaRDI portal
scientific article; zbMATH DE number 6999448
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On optimal polynomial time approximations: P-levelability vs. δ-levelability |
scientific article; zbMATH DE number 6999448 |
Statements
On optimal polynomial time approximations: P-levelability vs. δ-levelability (English)
0 references
10 January 2019
0 references
polynomial time
0 references
Turing machine
0 references
polynomial approximation
0 references
optimal approximation
0 references
levelability concept
0 references
