메뉴 건너뛰기




Volumn 35, Issue 4, 2006, Pages 903-931

Using nondeterminism to amplify hardness

Author keywords

Average case complexity; Hardness amplification; Noise stability; Pseudorandom generators for space bounded computation

Indexed keywords

AVERAGE-CASE COMPLEXITY; HARDNESS AMPLIFICATION; NOISE STABILITY; PSEUDORANDOM GENERATORS FOR SPACE-BOUNDED COMPUTATION;

EID: 33747154808     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447281     Document Type: Conference Paper
Times cited : (46)

References (39)
  • 2
    • 0002771903 scopus 로고
    • Nondeterministic exponential time has two-prover interactive protocols
    • L. BABAI, L. FORTNOW, AND C. LUND, Nondeterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
    • (1991) Comput. Complexity , vol.1 , pp. 3-40
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 3
    • 0001338853 scopus 로고
    • BPP has subexponential time simulations unless EXPTIME has publishable proofs
    • L. BASAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
    • (1993) Comput. Complexity , vol.3 , pp. 307-318
    • Basai, L.1    Fortnow, L.2    Nisan, N.3    Wigderson, A.4
  • 4
    • 33745511846 scopus 로고
    • Hiding instances in multioracle queries
    • Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, Springer, New York
    • D. BEAVER AND J. FEIGENBAUM, Hiding instances in multioracle queries, in Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 415, Springer, New York, 1990, pp. 37-48.
    • (1990) Lecture Notes in Comput. Sci. , vol.415 , pp. 37-48
    • Beaver, D.1    Feigenbaum, J.2
  • 5
    • 0002897287 scopus 로고
    • Collective coin-flipping
    • Silvio Micali, ed., Academic Press, New York
    • M. BEN-OR AND N. LINIAL, Collective coin-flipping, in Randomness and Computation, Silvio Micali, ed., Academic Press, New York, 1990, pp. 91-115.
    • (1990) Randomness and Computation , pp. 91-115
    • Ben-Or, M.1    Linial, N.2
  • 7
    • 84957045104 scopus 로고    scopus 로고
    • On the hardness of the permanent
    • Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, New York
    • J.-Y. CAI, A. PAVAN, AND D. SIVAKUMAR, On the hardness of the permanent, in Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1563, Springer-Verlag, New York, 1999, pp. 90-99.
    • (1999) Lecture Notes in Comput. Sci. , vol.1563 , pp. 90-99
    • Cai, J.-Y.1    Pavan, A.2    Sivakumar, D.3
  • 8
    • 0039015429 scopus 로고    scopus 로고
    • On the hardness of computing the permanent of random matrices
    • U. FEIGE AND C. LUND, On the hardness of computing the permanent of random matrices, Comput. Complexity, 6 (1996), pp. 101-132.
    • (1996) Comput. Complexity , vol.6 , pp. 101-132
    • Feige, U.1    Lund, C.2
  • 9
    • 0027684980 scopus 로고
    • Random-self-reducibility of complete sets
    • J. FEIGENBAUM AND L. FORTNOW, Random-self-reducibility of complete sets, SIAM J. Comput., 22 (1993), pp. 994-1005.
    • (1993) SIAM J. Comput. , vol.22 , pp. 994-1005
    • Feigenbaum, J.1    Fortnow, L.2
  • 10
    • 84858935906 scopus 로고    scopus 로고
    • Balanced NP sets
    • L. FORTNOW, Balanced NP sets, Computational Complexity Weblog, 2003, available online at http://weblog.fortnow.com/archive/2003_09_07_archive.html.
    • (2003) Computational Complexity Weblog
    • Fortnow, L.1
  • 11
    • 0003205419 scopus 로고    scopus 로고
    • A sample of samplers - A computational perspective on sampling (survey)
    • Electronic Colloquium on Computational Complexity (ECCC)
    • O. GOLDREICH, A sample of samplers - A computational perspective on sampling (survey), Technical report TR97-020, Electronic Colloquium on Computational Complexity (ECCC), 1997.
    • (1997) Technical Report , vol.TR97-020
    • Goldreich, O.1
  • 12
    • 0011247227 scopus 로고    scopus 로고
    • Modern cryptography, probabilistic proofs, and pseudorandomness
    • Springer-Verlag, Berlin
    • O. GOLDREICH, Modern Cryptography, Probabilistic Proofs, and Pseudorandomness, Algorithms Combin. 17, Springer-Verlag, Berlin, 1999.
    • (1999) Algorithms Combin. , vol.17
    • Goldreich, O.1
  • 15
    • 2442638659 scopus 로고
    • On Yao's XOR lemma
    • Electronic Colloquium on Computational Complexity
    • O. GOLDREICH, N. NISAN, AND A. WIGDERSON, On Yao's XOR Lemma, Technical Report TR95-050, Electronic Colloquium on Computational Complexity, 1995, available online at http://www.eccc.uni-trier.de/eccc.
    • (1995) Technical Report , vol.TR95-050
    • Goldreich, O.1    Nisan, N.2    Wigderson, A.3
  • 16
    • 35048863410 scopus 로고    scopus 로고
    • Fooling parity tests with parity gates
    • Proceedings of the Eighth International Workshop on Randomization and Computation (RANDOM), Springer-Verlag, New York
    • D. GUTFREUND AND E. VIOLA, Fooling parity tests with parity gates, in Proceedings of the Eighth International Workshop on Randomization and Computation (RANDOM), Lecture Notes in Comput. Sci. 3122, Springer-Verlag, New York, 2004, pp. 381-392.
    • (2004) Lecture Notes in Comput. Sci. , vol.3122 , pp. 381-392
    • Gutfreund, D.1    Viola, E.2
  • 21
    • 0035734550 scopus 로고    scopus 로고
    • Randomness vs. time: Derandomization under a uniform assumption
    • R. IMPAGLIAZZO AND A. WIGDERSON, Randomness vs. time: Derandomization under a uniform assumption, J. Comput. System Sci., 63 (2001), pp. 672-688.
    • (2001) J. Comput. System Sci. , vol.63 , pp. 672-688
    • Impagliazzo, R.1    Wigderson, A.2
  • 23
    • 0038290332 scopus 로고    scopus 로고
    • Boosting and hard-core sets
    • A. KLIVANS AND R. A. SERVEDIO, Boosting and hard-core sets, Machine Learning, 53 (2003), pp. 217-238.
    • (2003) Machine Learning , vol.53 , pp. 217-238
    • Klivans, A.1    Servedio, R.A.2
  • 24
    • 0022663555 scopus 로고
    • Average case complete problems
    • L. A. LEVIN, Average case complete problems, SIAM J. Comput., 15 (1986), pp. 285-286.
    • (1986) SIAM J. Comput. , vol.15 , pp. 285-286
    • Levin, L.A.1
  • 27
    • 0141738444 scopus 로고    scopus 로고
    • On the noise sensitivity of monotone functions
    • E. MOSSEL AND R. O'DONNELL, On the noise sensitivity of monotone functions, Random Struct. Algorithms, 23 (2003), pp. 333-350.
    • (2003) Random Struct. Algorithms , vol.23 , pp. 333-350
    • Mossel, E.1    O'Donnell, R.2
  • 28
    • 0008827213 scopus 로고
    • Pseudorandom bits for constant depth circuits
    • N. NISAN, Pseudorandom bits for constant depth circuits, Combinatorica, 11 (1991), pp. 63-70.
    • (1991) Combinatorica , vol.11 , pp. 63-70
    • Nisan, N.1
  • 29
    • 0000947929 scopus 로고
    • Pseudorandom generators for space-bounded computation
    • N. NISAN, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), pp. 449-461.
    • (1992) Combinatorica , vol.12 , pp. 449-461
    • Nisan, N.1
  • 31
    • 2942702375 scopus 로고    scopus 로고
    • Hardness amplification within NP
    • R. O'DONNELL, Hardness amplification within NP, J. Comput. System Sci., 69 (2004), pp. 68-94.
    • (2004) J. Comput. System Sci. , vol.69 , pp. 68-94
    • O'Donnell, R.1
  • 32
    • 27844593208 scopus 로고    scopus 로고
    • Simple extractors for all min-entropies and a new pseudorandom generator
    • R. SHALTIEL AND C. UMANS, Simple extractors for all min-entropies and a new pseudorandom generator, J. ACM, 52 (2005), pp. 172-216.
    • (2005) J. ACM , vol.52 , pp. 172-216
    • Shaltiel, R.1    Umans, C.2
  • 33
    • 0035276434 scopus 로고    scopus 로고
    • Pseudorandom generators without the XOR lemma
    • M. SUDAN, L. TREVISAN, AND S. VADHAN, Pseudorandom generators without the XOR lemma, J. Comput. System Sci., 62 (2001), pp. 236-266.
    • (2001) J. Comput. System Sci. , vol.62 , pp. 236-266
    • Sudan, M.1    Trevisan, L.2    Vadhan, S.3
  • 36
    • 0142027847 scopus 로고    scopus 로고
    • Pseudo-random generators for all hardnesses
    • C. UMANS, Pseudo-random generators for all hardnesses, J. Comput. System Sci., 67 (2003), pp. 419-440.
    • (2003) J. Comput. System Sci. , vol.67 , pp. 419-440
    • Umans, C.1
  • 37
    • 15244355932 scopus 로고    scopus 로고
    • The complexity of constructing pseudorandom generators from hard functions
    • E. VIOLA, The complexity of constructing pseudorandom generators from hard functions, Comput. Complexity, 13 (2004), pp. 147-188.
    • (2004) Comput. Complexity , vol.13 , pp. 147-188
    • Viola, E.1
  • 38
    • 27644449284 scopus 로고    scopus 로고
    • On constructing parallel pseudorandom generators from one-way functions
    • San Jose, CA, IEEE Press, Piscataway, NJ
    • E. VIOLA, On constructing parallel pseudorandom generators from one-way functions, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity, San Jose, CA, IEEE Press, Piscataway, NJ, 2005, pp. 183-197.
    • (2005) Proceedings of the 20th Annual IEEE Conference on Computational Complexity , pp. 183-197
    • Viola, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.