scientific article; zbMATH DE number 2221549

zbMath1089.68045MaRDI QIDQ5702337

Vangelis Th. Paschos

Publication date: 1 November 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial approximationcomplexity classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation ⋮ A survey on the structure of approximation classes ⋮ When polynomial approximation meets exact computation ⋮ When polynomial approximation meets exact computation ⋮ Reductions, completeness and the hardness of approximability

This page was built for publication: