• DOI:10.1109/ISTCS.1993.253477
Corpus ID: 20190995

Optimal speedup of Las Vegas algorithms

@article{Luby1993OptimalSO,
  title={Optimal speedup of Las Vegas algorithms},
  author={M. Luby and A. Sinclair and David Zuckerman},
  journal={[1993] The 2nd Israel Symposium on Theory and Computing Systems},
  year={1993},
  pages={128-133}
}

M. Luby, A. Sinclair, David Zuckerman

Published 1993

Mathematics, Computer Science

[1993] The 2nd Israel Symposium on Theory and Computing Systems

Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when its stops but whose running time is a random variable. The authors consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A as follows: run A for a fixed amount of time t/sub 1/, then run A independent for a fixed amount of time t/sub 2/, etc. The simulation stops if A completes its execution during any of the runs. Let… CONTINUE READING

View on IEEE

cs.utexas.edu

Save to Library

Create Alert

Cite

Launch Research Feed