Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01911843n
Noun Named Entity
SYL
No term available
EN
In computational complexity theory, the class QIP is the quantum computing analogue of the classical complexity class IP, which is the set of problems solvable by an interactive proof system with a polynomial-time verifier and one computationally unbounded prover. Wikipedia
English:
complexity
Relations
Sources
IS A
EN
complexity class
SAID TO BE THE SAME AS
EN
PSPACE
EN
IP

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