Complexity of Hard-Core Set Proofs

Computational Complexity

Volumn 20, Issue 1, 2011, Pages 145-171

  Lu, Chi Jen ^a   Tsai, Shi Chun ^b   Wu, Hsin Lung ^c  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c NATIONAL TAIPEI UNIVERSITY   (Taiwan)

Author keywords

black box proofs; Hard core set; hardness amplification

Indexed keywords

EID: 85027956216     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-011-0003-7     Document Type: Article

References (25)

1. Noga Alon & Joel H. Spencer (2000). The Probabilistic Method. Wiley, New York, 2nd edition.
2. Babai László, Fortnow Lance, Nisan Noam, Wigderson Avi (1993) BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3(4): 307-318.
3. Boaz Barak, Moritz Hardt & Satyen Kale (2009). The uniform hardcore lemma via approximate Bregman projections. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 1193-1200.
4. Freund Yoav (1995) Boosting a Weak Learning Algorithm by Majority. Information and Computation 121(2): 256-285.
5. Goldmann Mikael, Hastad Johan, Razborov Alexander A. (1992) Majority Gates VS. General Weighted Threshold Gates. Computational Complexity 2: 277-300.
6. Hajnal Andras, Maass Wolfgang, Pudlak Pavel, Szegedy Mario, Turan Gyorgy (1993) Threshold Circuits of Bounded Depth. Journal of Computer System Sciences 46(2): 129-154.
7. Healy Alexander, Salil Vadhan P., Viola Emanuele (2006) Using Nondeterminism to Amplify Hardness. SIAM Journal of Computing 35(4): 903-931.
8. Thomas Holenstein (2005). Key agreement from weak bit agreement. In Proceedings of the 37th ACM Symposium on Theory of Computing, 664-673.
9. Russell Impagliazzo (1995). Hard-Core Distributions for Somewhat Hard Problems. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, 538-545.
10. Russell Impagliazzo & Avi Wigderson (1997). P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma. In Proceedings of the 29th ACM Symposium on Theory of Computing, 220-229.
11. Klivans Adam R, Servedio Rocco A (2003) Boosting and Hard-Core Set Construction. Machine Learning 51(3): 217-238.
12. Chi-Jen Lu, Shi-Chun Tsai & Hsin-Lung Wu (2007). On the Complexity of Hard-Core Set Constructions. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming, 183-194.
13. Lu Chi-Jen, TsaiShi-Chun. Wu Hsin-Lung (2008) On the Complexity of Hardness Amplification. IEEE Transactions on Information Theory 54(10): 4575-4586.
14. O'Donnell Ryan (2004) Hardness amplification within NP. Journal of Computer System Sciences 69(1): 68-94.
15. Pisier Gilles (1981) Remarques sur un resultat non publié de B. Maurey. Seminaire Analyse fonctionnelle 1(12): 1980-1981.
16. Ronen Shaltiel, Emanuele Viola (2008). Hardness amplification proofs require majority. In Proceedings of the 40th annual ACM symposium on Theory of computing, 589-598.
17. Roman Smolensky (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the 19th annual ACM symposium on Theory of computing, 77-82.
18. Sudan Madhu, Trevisan Luca, Vadhan Salil (2001) Pseudorandom generators without the XOR lemma. Journal of Computer System Sciences 62(2): 236-266.
19. Márió Szegedy (1989). Algebraic methods in lower bounds for computational models with limited communication. Ph. D. thesis.
20. Jun Tarui (1991). Degree complexity of Boolean functions and its applications to relativized separations. In Proceedings of the 6th Annual IEEE Conference on Structure in Complexity Theory, 382-390.
21. Luca Trevisan (2003). List-Decoding Using The XOR Lemma. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 126-135.
22. Luca Trevisan (2005). On uniform amplification of hardness in NP. In Proceedings of the 37th ACM Symposium on Theory of Computing, 31-38.
23. Turán Pál (1941) On an extremal problem in graph theory. Matematikai és Fizikai Lapok 48: 436-452.
24. Emanuele Viola (2006). The complexity of hardness amplification and derandomization. Ph. D. thesis.
25. Andrew C. Yao (1982). Theory and application of trapdoor functions. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 80-91.