Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03252161n
Noun Named Entity
EL
No term available
EN
In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error. Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
υπολογιστικό πρόβλημα
SAID TO BE THE SAME AS
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