On uniform amplification of hardness in NP

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 31-38

  Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Amplification of hardness; Average case complexity

Indexed keywords

AMPLIFICATION OF HARDNESS; AVERAGE-CASE COMPLEXITY;

ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTATIONAL COMPLEXITY;

EID: 34047145017     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060595     Document Type: Conference Paper

References (19)

1. BEN-DAVID, S., CHOR, B., GOLDREICH, O., AND LUBY, M. On the theory of average case complexity. Journal of Computer and System Sciences 44, 2 (1992), 193-219.
2. BOGDANOV, A., AND TREVISAN, L. On wost-case to average-case reductions for NP problems. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (2003), pp. 308-317.
3. BONEH, D., AND LIPTON, R. J. Amplification of weak learning under the uniform distribution. In Proceedings of the 6th ACM Conference on Computational Learning Theory (1993), pp. 347-351.
4. GOLDREICH, O., NISAN, N., AND WIGDERSON, A. On Yao's XOR lemma. Tech. Rep. TR95-50, Electronic Colloquium on Computational Complexity, 1995.
5. HEALY, A., VADHAN, S., AND VIOLA, E. Using nondeterminism to amplify hardness. In Proceedings of the 36th ACM Symposium on Theory of Computing (2004).
6. IMPAGLIAZZO, R. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (1995), pp. 538-545.
7. IMPAGLIAZZO, R. A personal view of average-case complexity. In Proceedings of the 10th IEEE Conference on Structure in Complexity Theory (1995), pp. 134-147.
8. IMPAGLIAZZO, R. Hardness as randomness: a survey of universal derandomization. In Proceedings of the International Congress of Mathematicians (2002), vol. 3, pp. 659-672.
9. IMPAGLIAZZO, R., AND LEVIN, L. No better ways to generate hard NP instances than picking uniformly at random. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (1990), pp. 812-821.
10. IMPAGLIAZZO, R., AND WIGDERSON, A. P = BPP unless E has sub-exponential circuits. In Proceedings of the 29th ACM Symposium on Theory of Computing (1997), pp. 220-229.
11. LEVIN, L. One-way functions and pseudorandom generators. Combinatorial 7, 4 (1987), 357-363.
12. MOSSEL, E., AND O'DONNELL, R. On the noise sensitivity of monotone functions. Random Structures and Algorithms 23, 3 (2003), 333-350.
13. O'DONNELL, R. Hardness amplification within NP. In Proceedings of the 34th ACM Symposium on Theory of Computing (2002), pp. 751-760.
14. SPIELMAN, D. Linear time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory 42, 6 (1996), 1723-1732.
15. SUDAN, M., TREVISAN, L., AND VADHAN, S. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences 62, 2 (2001), 236-266.
16. TREVISAN, L. List-decoding using the XOR Lemma. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (2003), pp. 126-135.
17. TREVISAN, L., AND VADHAN, S. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th IEEE Conference on Computational Complexity (2002), pp. 129-138.
18. VIOLA, E. Hardness vs. randomness within alternating time. In Proceedings of the 18th IEEE Conference on Computational Complexity (2003).
19. YAO, A. Theory and applications of trapdoor functions. In Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (1982), pp. 80-91.