๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Complexity of Polynomial-Time Approximation

โœ Scribed by Liming Cai; Michael Fellows; David Juedes; Frances Rosamond

Publisher
Springer
Year
2007
Tongue
English
Weight
253 KB
Volume
41
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the efficiency of polynomial time app
On the efficiency of polynomial time approximation schemes
โœ Marco Cesati; Luca Trevisan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 630 KB

A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that given in input an instance of A and E > 0 find;,; (1 + E)-approximate solution in time that is polynomial for each fixed E. Typical running times are no(+) or 2"' n. While algorithms of the former kind t

Self-witnessing polynomial-time complexi
Self-witnessing polynomial-time complexity and prime factorization
โœ Michael R. Fellows; Neal Koblitz ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 295 KB

Abstracl. For a number of computational search problems, the existence of a polynomial-time algorithm for the problem implies that a polynomial-time algorithm for the problem is constructively known. Some instances of such self-witnessing polynomial-lime complexity are presented. Our main resuk demo