Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01322481n
Noun Concept
JA
No term available
EN
In computational complexity theory, P/poly is a complexity class representing problems that can be solved by small circuits. Wikipedia
Relations
Sources
IS A
複雑性クラス
計算問題
HAS PART
BPP
P

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