In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probabilityâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- Bruno Blanchet
- IEEE Transactions on Dependable and Secureâ€¦
- 2005

We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our toolâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Daniele Micciancio, Bogdan Warinschi
- TCC
- 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

- Michael L. Littman, Judy Goldsmith, Martin Mundhenk
- J. Artif. Intell. Res.
- 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

- Johan HÃ¥stad
- 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

- Seinosuke Toda
- SIAM J. Comput.
- 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

- Alfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto
- STOC
- 1991

Previously, no general-purpose algorithm was known for the elliptic curve logarithm problem that ran in better than exponentialâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- MartÃn Abadi, Joan Feigenbaum, Joe Kilian
- Structure in Complexity Theory Conference
- 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

- LÃ¡szlÃ³ Babai, Peter Frankl, Janos Simon
- 27th Annual Symposium on Foundations of Computerâ€¦
- 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

- Randal B. Watson
- 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?