On the complexity of hard-core set constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 183-194

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

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

HARD CORE SET CONSTRUCTIONS; INAPPLICABILITY; NON UNIFORM COMPLEXITY;

SET THEORY;

EID: 38149136502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_18     Document Type: Conference Paper

References (19)

1. Alon, N., Spencer, J.: The probabilistic method, 2nd edn. Wiley-Interscience, New York (2000)
2. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3(4), 307-318 (1993)
3. Goldmann, M., Håstad, J., Razborov, A.: Majority gates vs. general weighted threshold gates. Computational Complexity 2, 277-300 (1992)
4. Hajnal, A., Maass, W., Pudlák, P., Szegedy, M., Turan, G.: Threshold circuits of bounded depth. In: Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pp. 99-110 (1987)
5. Healy, A., Vadhan, S., Viola, E.: Using nondeterminism to amplify hardness. SIAM Journal on Computing 35(4), 903-931 (2006)
6. Holenstein, T.: Key agreement from weak bit agreement. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 664-673. ACM Press, New York (2005)
7. Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pp. 538-545. IEEE Computer Society Press, Los Alamitos (1995)
8. Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 220-229. ACM Press, New York (1997)
9. Klivans, A., Servedio, R.A.: Boosting and hard-core sets. Machine Learning 51(3), 217-238 (2003)
10. Lu, C-J., Tsai, S.-C., Wu, H.-L.: On the complexity of hardness amplification. In: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pp. 170-182. IEEE Computer Society Press, Los Alamitos (2005)
11. O'Donnell, R.: Hardness amplification within NP. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 751-760. ACM Press, New York (2002)
12. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences 62(2), 236-266 (2001)
13. Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 77-82. ACM Press, New York (1987)
14. Szegedy, M.: Algebraic methods in lower bounds for computational models with limited communication. Ph.D. thesis, University of Chicago (1989)
15. Tarui, J.: Degree complexity of boolean functions and its applications to relativized separations. In: Proceedings of the 6th Annual IEEE Conference on Structure in Complexity Theory, pp. 382-390. IEEE Computer Society Press, Los Alamitos (1991)
16. Trevisan, L.: List decoding using the XOR lemma. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 126-135. IEEE Computer Society Press, Los Alamitos (2003)
17. Trevisan, L.: On uniform amplification of hardness in NP. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 31-38. ACM Press, New York (2005)
18. Viola, E.: The Complexity of Hardness Amplification and Derandomization. Ph.D. thesis, Harvard University (2006)
19. Yao, A.: Theory and applications of trapdoor functions. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 80-91. IEEE Computer Society Press, Los Alamitos (1982)