Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00244011n
Noun Named Entity
SYL
No term available
EN
In theoretical computer science, almost wide probabilistic polynomial-time is a complexity class contained in PP defined via GapP functions. Wikipedia
English:
complexity
Relations
Sources
IS A
EN
complexity class
EN
computational problem
HAS PART
Bqp
PART OF
EN
PP

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