In the Vinony graph
Within Vinony's link graph, Класс PP is referenced by 108 other articles, and connects out to NP-complete, NP and polynomial hierarchy.
It is catalogued under topics including Probabilistic complexity classes and Quantum complexity theory.
Its subject is documented across 13 Wikipedia language editions.
Wikidata facts
- Instance of
- complexity class
- Subclass of
- computational problem
- Part of
- PSPACE
- Has part
- QMA
Sources (3)
via Wikidata · CC0
Article · Русский
В теории сложности, PP является классом проблем, решаемых вероятностными машинами Тьюринга за полиномиальное время, с вероятностью ошибки менее 1/2. Аббревиатура PP обозначает «вероятностный полиномиальный по времени».
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
NP-complete
Entity
NP
Entity
polynomial hierarchy
Entity
Scott Aaronson
Entity
♯P
Entity
International Standard Book Number
Entity
digital object identifier
Entity
union
Entity
bibcode
Entity
arXiv
Entity
intersection
Entity
quantum computing
Entity
computational complexity theory
Entity
Semantic Scholar
Entity
symmetric difference
Entity
time complexity
Entity
decision problem
Entity
P
Entity
boolean satisfiability problem
Entity
regular language
Entity