Bailey, Delbert D.; Dalmau, Víctor; Kolaitis, Phokion G.
(Elsevier, 2007)
The complexity class PP consists of all decision problems solvable by polynomial-time probabilistic Turing machines. It is well known that PP is a highly intractable complexity class and that PP-complete problems are in ...