Bounded independence plus noise
Derandomization is a fundamental research area in theoretical computer science. In the past decade, researchers have been able to derandomize a number of computational problems, leading to breakthrough discoveries such as proving SL=L, explicit constructions of Ramsey graphs and optimal-rate error-c...
| Published: |
|
|---|---|
| Online Access: | http://hdl.handle.net/2047/D20321694 |