Blar i Department of Informatics på emneord "VDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422"
Viser treff 1-1 av 1
-
Structure of Polynomial-Time Approximation
(Peer reviewed; Journal article, 2011-10-14)Approximation schemes are commonly classified as being either a polynomial-time approximation scheme (ptas) or a fully polynomial-time approximation scheme (fptas). To properly differentiate between approximation schemes ...