Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01293281n
Noun Named Entity
JA
No term available
EN
In computational complexity theory, the class APX is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant. Wikipedia
Relations
Sources
IS A
複雑性クラス
HAS PART
多項式時間近似スキーム

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License