Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/AWPP_(complexity)> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- AWPP_(complexity) abstract "In theoretical computer science, Almost Wide Probabilistic Polynomial-Time (AWPP) is a complexity class for problems in the context of quantum computing.AWPP contains the BQP (Bounded error, Quantum, Polynomial time) class, which contains the decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. In fact, it is the best known classical upper bound for BQP. Furthermore, it is contained in the APP class.".
- AWPP_(complexity) wikiPageExternalLink 9811023.
- AWPP_(complexity) wikiPageExternalLink index.html.
- AWPP_(complexity) wikiPageExternalLink quantum.pdf.
- AWPP_(complexity) wikiPageExternalLink awpp.
- AWPP_(complexity) wikiPageID "11204535".
- AWPP_(complexity) wikiPageLength "1497".
- AWPP_(complexity) wikiPageOutDegree "8".
- AWPP_(complexity) wikiPageRevisionID "497800879".
- AWPP_(complexity) wikiPageWikiLink APP_(complexity_class).
- AWPP_(complexity) wikiPageWikiLink BQP.
- AWPP_(complexity) wikiPageWikiLink Category:Probabilistic_complexity_classes.
- AWPP_(complexity) wikiPageWikiLink Category:Quantum_complexity_theory.
- AWPP_(complexity) wikiPageWikiLink Complexity_class.
- AWPP_(complexity) wikiPageWikiLink Decision_problem.
- AWPP_(complexity) wikiPageWikiLink Polynomial_time.
- AWPP_(complexity) wikiPageWikiLink Quantum_computing.
- AWPP_(complexity) wikiPageWikiLink Time_complexity.
- AWPP_(complexity) wikiPageWikiLinkText "AWPP (complexity)".
- AWPP_(complexity) hasPhotoCollection AWPP_(complexity).
- AWPP_(complexity) subject Category:Probabilistic_complexity_classes.
- AWPP_(complexity) subject Category:Quantum_complexity_theory.
- AWPP_(complexity) hypernym Class.
- AWPP_(complexity) comment "In theoretical computer science, Almost Wide Probabilistic Polynomial-Time (AWPP) is a complexity class for problems in the context of quantum computing.AWPP contains the BQP (Bounded error, Quantum, Polynomial time) class, which contains the decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. In fact, it is the best known classical upper bound for BQP. Furthermore, it is contained in the APP class.".
- AWPP_(complexity) label "AWPP (complexity)".
- AWPP_(complexity) sameAs m.02r3ljh.
- AWPP_(complexity) sameAs Q4655144.
- AWPP_(complexity) sameAs Q4655144.
- AWPP_(complexity) wasDerivedFrom AWPP_(complexity)?oldid=497800879.
- AWPP_(complexity) isPrimaryTopicOf AWPP_(complexity).