多項式時間近似スキーム
1. Polynomial-time approximation schemeIn computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP-hard optimization problems). A PTAS is an algorithm which takes an instance of an optimization problem and a parameter ε > 0 and, in polynomial time, produces a solution that is within a factor 1 + ε of being optimal (or 1 - ε for maximization problems).
Read “Polynomial-time approximation scheme” on English Wikipedia
Read “多項式時間近似スキーム” on Japanese Wikipedia
Read “Polynomial-time approximation scheme” on DBpedia
Read “Polynomial-time approximation scheme” on English Wikipedia
Read “多項式時間近似スキーム” on Japanese Wikipedia
Read “Polynomial-time approximation scheme” on DBpedia
Discussions
Log in to talk about this word.