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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1935-2018
05010019352017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We prove that, unless any problem in NP can be solved in probabilistic polynomial time, for any ǫ > 0, the size of the largest… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • Miklós Ajtai
  • Electronic Colloquium on Computational Complexity
  • 1996
We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which nds a short vector… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper, two interesting complexity classes, PP and P, are compared with PH, the polynomial-time hierarchy. It is shown… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Previously, no general-purpose algorithm was known for the elliptic curve logarithm problem that ran in better than exponential… (More)
  • table 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We consider the problem of computing with encrypted data. Player A wishes to know the value f(x) for some x but lacks the power… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity… (More)
Is this relevant?
Highly Cited
1944
Highly Cited
1944
Jones, B.Sc., iM.Ch. Orth., F.R.C.S. (L'pool). Volumes I and II. Third Edition. 1944. E. and S. Livingstone, Edinburgh. Pp. xi… (More)
Is this relevant?