Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/EQP_(complexity)> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- EQP_(complexity) abstract "In computational complexity theory, EQP (sometimes called QP), which stands for exact quantum polynomial time, is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability 1 and runs in polynomial time. It is the quantum analogue of the complexity class P.In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem exactly and is guaranteed to run in polynomial time.".
- EQP_(complexity) wikiPageID "27942982".
- EQP_(complexity) wikiPageLength "682".
- EQP_(complexity) wikiPageOutDegree "8".
- EQP_(complexity) wikiPageRevisionID "671586450".
- EQP_(complexity) wikiPageWikiLink Algorithm.
- EQP_(complexity) wikiPageWikiLink Category:Quantum_complexity_theory.
- EQP_(complexity) wikiPageWikiLink Computational_complexity_theory.
- EQP_(complexity) wikiPageWikiLink Decision_problem.
- EQP_(complexity) wikiPageWikiLink Decision_problems.
- EQP_(complexity) wikiPageWikiLink P_(complexity).
- EQP_(complexity) wikiPageWikiLink Polynomial_time.
- EQP_(complexity) wikiPageWikiLink Quantum_algorithm.
- EQP_(complexity) wikiPageWikiLink Quantum_computer.
- EQP_(complexity) wikiPageWikiLink Quantum_computing.
- EQP_(complexity) wikiPageWikiLink Time_complexity.
- EQP_(complexity) wikiPageWikiLinkText "EQP".
- EQP_(complexity) wikiPageWikiLinkText "QP or EQP".
- EQP_(complexity) hasPhotoCollection EQP_(complexity).
- EQP_(complexity) wikiPageUsesTemplate Template:CZoo.
- EQP_(complexity) wikiPageUsesTemplate Template:ComplexityClasses.
- EQP_(complexity) wikiPageUsesTemplate Template:Quantum_computing.
- EQP_(complexity) subject Category:Quantum_complexity_theory.
- EQP_(complexity) hypernym Problems.
- EQP_(complexity) type Disease.
- EQP_(complexity) comment "In computational complexity theory, EQP (sometimes called QP), which stands for exact quantum polynomial time, is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability 1 and runs in polynomial time. It is the quantum analogue of the complexity class P.In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem exactly and is guaranteed to run in polynomial time.".
- EQP_(complexity) label "EQP (complexity)".
- EQP_(complexity) sameAs m.0ch54x0.
- EQP_(complexity) sameAs Q5323985.
- EQP_(complexity) sameAs Q5323985.
- EQP_(complexity) wasDerivedFrom EQP_(complexity)?oldid=671586450.
- EQP_(complexity) isPrimaryTopicOf EQP_(complexity).