[an error occurred while processing this directive]
An error occured whilst processing this directive
Algorithms & Complexity group
Laboratory for Foundations of Computer Science
School of Informatics
University of Edinburgh
The Edinburgh Team
- GRANT HOLDER:
- Professor Mark Jerrum
- Dr Mary Cryan
- Dr. Kyriakos Kalorkoti
Other teams
- Inst Fuer Informatik der Universitaet Bonn
- Centre National de la Recherche Scientifique
- University of Oxford
- University of Leeds
- Lund University
Summary
In recent years, randomized algorithms and the randomized
complexity of computational problems have become major subjects of
study in the design of computer algorithms. For some computational
problems it appears now that the randomized or the
pseudo-randomized algorithms are more efficient than the
deterministic ones (in terms of running time, hardware size,
circuits depths, transparent description, etc.). This Working Group
will address the fundamental issues of the design of efficient
randomized algorithms as well as fundamental complexity questions
of randomized computation concerning their time and space
efficiency, computation with limited randomness resources, and the
problems of deterministic simulation of randomized computation.
An error occured whilst processing this directive