Some Applications of Coding Theory in Computational Complexity (2004)
Cached
Download Links
- [www.cs.berkeley.edu]
- [www.cs.berkeley.edu]
- [www.cs.columbia.edu]
- DBLP
Other Repositories/Bibliography
by
Luca Trevisan
| Citations: | 42 - 2 self |
BibTeX
@MISC{Trevisan04someapplications,
author = {Luca Trevisan},
title = {Some Applications of Coding Theory in Computational Complexity},
year = {2004}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable error-correcting codes, and their applications to complexity theory and to cryptography.
