Derandomization: A brief overview
Valentine Kabanets
Abstract
This survey focuses on the recent (1998-2003) developments in the area of derandomization, with the emphasis on the derandomization of time-bounded randomized complexity classes.
Versions
- book chapter in Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol 1: Algorithms and Complexity, edited by G. Paun, G. Rosenberg, and A. Salomaa, World Scientific Publishing Company, April 2004.
- early version in Bulletin of the European Association for Theoretical Computer Science, Number 76, pages 88-103, 2002.