Skip to search formSkip to main contentSkip to account menu

PP (complexity)

Known as: Probabilistic Polynomial Time, Probabilistic polynomial time (PPT), PP 
In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
An abstract of the first part of this memoir, which dealt with the structure and relations of the air-bladder and Weber’s… 
Highly Cited
2009
Highly Cited
2009
THIS the concluding volume of the great history of English literature produced by the Cambridge University Press, on the… 
Highly Cited
2003
Highly Cited
2003
Although the miscibility of silicates, including clay minerals, with organics and polymers has been known since the early 1950s… 
Highly Cited
1980
Highly Cited
1970
Highly Cited
1970
The Practice of Behavior TherapyBy Joseph Wolpe. (Pergamon General Psychology Series.) Pp. x + 314. (Pergamon Press: Oxford… 
Review
1949
Review
1949
THE “Reports on Progress in Physics” have always fulfilled a valuable function in acquainting the specialist in any one of the… 
Highly Cited
1938
Highly Cited
1938
M.D., S.D. 1938. W. B. Saunders cohih??'' Philadelphia and London. Pp. 434. illustrated Price, 20s. This is a book which will… 
Highly Cited
1931
Highly Cited
1931
NO section of engineering science has been so frequently dealt with in treatise or textbook as that which provides the title…