Computer Science – Computational Complexity
Scientific paper
2006-01-23
Computer Science
Computational Complexity
Submitted to the Proceedings of ICM'06, Madrid
Scientific paper
In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or unknown. In computer science, probabilistic algorithms are sometimes simpler and more efficient than the best known deterministic algorithms for the same problem. Despite this evidence for the power of random choices, the computational theory of pseudorandomness shows that, under certain complexity-theoretic assumptions, every probabilistic algorithm has an efficient deterministic simulation and a large class of applications of the the probabilistic method can be converted into explicit constructions. In this survey paper we describe connections between the conditional ``derandomization'' results of the computational theory of pseudorandomness and unconditional explicit constructions of certain combinatorial objects such as error-correcting codes and ``randomness extractors.''
No associations
LandOfFree
Pseudorandomness and Combinatorial Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Pseudorandomness and Combinatorial Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudorandomness and Combinatorial Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-601210