Optimal speedup of Las Vegas algorithms

Information Processing Letters

Volumn 47, Issue 4, 1993, Pages 173-180

  Luby, Michael ^a   Sinclair, Alistair ^b   Zuckerman, David ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b International Computer Science Institute 1947 Center Street Berkeley CA 94704 USA and University of Edinburgh Scotland United Kingdom ^*

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Design of algorithms; expected running time; Las Vegas algorithms; optimal strategy; proof search; randomized algorithms; theorem proving

Indexed keywords

OPTIMIZATION; RANDOM PROCESSES;

LOS VEGAS ALGORITHM;

ALGORITHMS;

EID: 0027663706     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(93)90029-9     Document Type: Article

References (2)

1. A method for obtaining randomized algorithms with small tail probabilities
2. OR-parallel theorem proving with random competition