Andrej Bogdanov, Ph.D.
Affiliations: | 2005 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Theory (THY), (Computational Complexity, Randomness in Computation, Combinatorial Optimization); Security (SEC)Google:
"Andrej Bogdanov"Parents
Sign in to add mentor| Luca Trevisan | grad student | 2005 | UC Berkeley | |
| (The relation between worst case and average case complexity for NP.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bogdanov A, Rosen A. (2013) Input Locality and Hardness Amplification Journal of Cryptology. 26: 144-171 |
| Bogdanov A, Viola E. (2010) Pseudorandom Bits for Polynomials Siam Journal On Computing. 39: 2464-2486 |
| Bogdanov A, Trevisan L. (2006) On worst-case to average-case reductions for NP problems Siam Journal On Computing. 36: 1119-1159 |