(Q1563053)

English

PP

complexity class of decision problems solvable by a probabilistic Turing machine in polynomial time with error probability <½ for all instances

Majority-P

In more languages

edit

Statements

instance of

complexity class

0 references

subclass of

computational problem

0 references

0 references

0 references

1 reference

imported from Wikimedia project

English Wikipedia

Wikimedia import URL

https://en.wikipedia.org/w/index.php?title=QMA&oldid=1032338513

said to be the same as

PostBQP

1 reference

imported from Wikimedia project

English Wikipedia

Wikimedia import URL

https://en.wikipedia.org/w/index.php?title=PP_(complexity)&oldid=1040620532

PQP

1 reference

imported from Wikimedia project

English Wikipedia

Wikimedia import URL

https://en.wikipedia.org/w/index.php?title=PP_(complexity)&oldid=1040620532

Identifiers

1 reference

28 October 2013

Microsoft Academic ID

185810876

0 references

(Q1563053)

PP

Statements

Identifiers

Sitelinks

Wikipedia(12 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)