Sciweavers

85
Voted
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
15 years 10 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan