Do Probabilistic Algorithms Outperform Deterministic Ones?

@inproceedings{Wigderson1998DoPA,
  title={Do Probabilistic Algorithms Outperform Deterministic Ones?},
  author={Avi Wigderson},
  booktitle={ICALP},
  year={1998}
}
The introduction of randomization into efficient computation has been one of the most fertile and usefifl ide,'~q in computer science. In cryl)tography and ,~synchronous comlmting, randomization makes possil)le t.asks that are iml)ossilfle to l)erform detcrnfinistically. For fimction coml)utation , many examples are known in which randomization allows considerable savings in resources like space and time over deterministic algorithms, or even "only" simplifies them. But to what extent is this… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Wigdcrson, "llardness vs Randomness

  • N. Nisan
  • .I. Comput. System Sei
  • 1994
Highly Influential
4 Excerpts

BPP h&s Subexponential T ime Simulations unlcss E X P T I M E has Pul)lishable Proofs

  • L. Bahai, L. Fortnow, N. Nisan, A. Wigderson
  • Complexity Theory,
  • 1993
Highly Influential
4 Excerpts

Pseudo-random bits for constant del)th circuits", Combinaloriea

  • N. Nis
  • I)l). 63-70,
  • 1991
Highly Influential
4 Excerpts

How to Generate Cryptographically Strong Sequences of Pseudol 'lmnlom Bits

  • M. Blum, S. Mieali
  • S I A M .I. Compnt.,
  • 1984
Highly Influential
4 Excerpts

Theory and AI)t)lication of Tral)door I~nctions", in 23st FOG'S

  • A. C. Yao
  • I)ages 80
  • 1982
Highly Influential
4 Excerpts

P=BPP unless E has sub-exponential circuits: Derandonfizing the XOR Lemnm

  • R. hnIagliazzo, A. Wigderson
  • in 29th STOC,
  • 1997
1 Excerpt

Hitting Sets Derandomize B P P

  • A. Andrcev, A. Clementi, J. Rolim
  • X X I I I Intern.ational Colloquium on Algorithms…
  • 1996
1 Excerpt

l l i t t ing Properties of t lard Boolean Operators and its Consequenccs on B P P

  • A. Andreev, A. Clenmnti, J. Rolim
  • 1996
1 Excerpt