SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 205-221

On pseudorandomness and resource-bounded measure

(2) Arvind, V a Köbler, Johannes b

a INSTITUTE OF MATHEMATICAL SCIENCES (India)

b UNIVERSITY OF ULM (Germany)

Author keywords

Derandomization; Probabilistic complexity classes; Pseudorandom generator; Resource bounded measure

Indexed keywords

COMPUTATIONAL COMPLEXITY; SET THEORY; THEOREM PROVING;

PROBABILISTIC COMPLEXITY CLASSES; PSEUDORANDOM GENERATORS; RESOURCE BOUNDED MEASURE;

RANDOM NUMBER GENERATION;

EID: 0034909808 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(99)00164-4 Document Type: Article

Times cited : (25)

References (30)

1
- 85117087055
- Measure on small complexity classes with applications for BPP
- IEEE Computer Society Press
- (1994) Proc. 35th IEEE Symp. on the Foundations of Computer Science , pp. 807-818
- Allender, E.¹ Strauss, M.²

2
- 84947714938
- Hitting sets derandomize BPP
- Proc. 23rd Internat. Coll. on Automata, Languages, and Programming, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1099 , pp. 357-368
- Andreev, A.¹ Clementi, A.² Rolim, J.³

3
- 84951167484
- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
- Proc. 24th Internat. Coll. on Automata, Languages, and Programming, Springer, Berlin
- (1977) Lecture Notes in Computer Science , vol.1256 , pp. 177-187
- Andreev, A.¹ Clementi, A.² Rolim, J.³

4
- 4243632778
- Technical Report UIB-97-05, University of Ulm, March
- (1997) On pseudorandomness and resource-bounded measure
- Arvind, V.¹ Köbler, J.²

5
- 84949195705
- On resource-bounded measure and pseudorandomness
- Proc. 17th Conf. on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin
- (1977) Lecture Notes in Computer Science , vol.1346 , pp. 235-249
- Arvind, V.¹ Köbler, J.²

6
- 0021980820
- Trading group theory for randomness
- ACM Press
- (1985) Proc. 17th ACM Symp. on Theory of Computing , pp. 421-429
- Babai, L.¹

7
- 0003923506
- Springer, Berlin
- (1990) Structural Complexity II, EATCS Monographs on Theoretical Computer Science
- Balcázar, J.L.¹ Díaz, J.² Gabarró, J.³

8
- 0003923506
- Springer, Berlin
- (1995) Structural Complexity I, EATCS Monographs on Theoretical Computer Science 2nd ed.
- Balcázar, J.L.¹ Díaz, J.² Gabarró, J.³

9
- 0028375184
- The complexity of decision versus search
- (1994) SIAM J. Comput. , vol.23 , pp. 97-119
- Bellare, M.¹ Goldwasser, S.²

10
- 0004444840
- PP is closed under truth-table reductions
- (1996) Inform. Comput. , vol.124 , Issue.1 , pp. 1-6
- Fortnow, L.¹ Reingold, N.²

11
- 0003251137
- Another proof that BPP⊆PH (and more)
- Technical Report TR97-045, October
- (1997) Electronic Colloquium on Computational Complexity
- Goldreich, O.¹ Zuckerman, D.²

12
- 0030706544
- P=BPP unless E has sub-exponential ciruits derandomizing the XOR lemma
- ACM Press, New York
- (1997) Proc. 29rd ACM Symp. on Theory of Computing , pp. 220-229
- Impagliazzo, R.¹ Wigderson, A.²

13
- 38249025494
- NP[log n] and sparse Turing-complete sets for NP
- (1989) J. Comput. System Sci. , vol.39 , pp. 282-298
- Kadin, J.¹

14
- 84944053247
- Some connections between nonuniform and uniform complexity classes
- ACM Press, New York
- (1980) Proc. 12th ACM Symp. on Theory of Computing , pp. 302-309
- Karp, R.M.¹ Lipton, R.J.²

15
- 0026851355
- Almost everywhere high nonuniform complexity
- (1992) J. Comput. System Sci. , vol.44 , pp. 220-258
- Lutz, J.H.¹

16
- 0027677846
- A pseudorandom oracle characterization of BPP
- (1993) SIAM J. Computing , vol.22 , pp. 1075-1086
- Lutz, J.H.¹

17
- 0040655704
- P
- (1997) Theory Comput. Systems , vol.30 , pp. 429-442
- Lutz, J.H.¹

18
- 0030246728
- Cook versus Karp-Levin: Separating reducibilities if NP is not small
- (1996) Theoret. Comput. Sci. , vol.164 , pp. 141-163
- Lutz, J.H.¹ Mayordomo, E.²

19
- 38249004940
- Circuit size relative to pseudorandom oracles
- (1993) Theoret. Comput. Sci. , vol.107 , pp. 95-120
- Lutz, J.H.¹ Schmidt, W.J.²

20
- 0028516244
- Hardness vs randomness
- (1994) J. Comput. System Sci. , vol.49 , pp. 149-167
- Nisan, N.¹ Wigderson, A.²

21
- 0003897694
- Addison-Wesley Reading, MA
- (1994) Computational Complexity
- Papadimitriou, C.¹

22
- 79952537130
- Super-bits, demi-bits, and NQP-natural proofs
- Proc. 1st Internat. Symp. on Randomization and Approximation Techniques in Computer Science (Random'97), Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1269 , pp. 85-93
- Rudich, S.¹

23
- 0024478681
- Relativized Arthur-Merlin versus Merlin-Arthur games
- (1989) Inform. Comput. , vol.80 , Issue.1 , pp. 44-49
- Santha, M.¹

24
- 38249025896
- Probabilistic complexity classes and lowness
- (1989) J. Comput. System Sci. , vol.39 , pp. 84-100
- Schöning, U.¹

25
- 84976667857
- On the generation of cryptographically strong pseudo-random sequences
- Proc. 8th Internat. Coll. on Automata, Languages, and Programming, Springer, Berlin
- (1981) Lecture Notes in Computer Science , vol.62 , pp. 544-550
- Shamir, A.¹

26
- 0022043952
- A complexity theory based on boolean algebra
- (1985) J. ACM , vol.32 , pp. 484-502
- Skyum, S.¹ Valiant, L.G.²

27
- 0026239342
- PP is as hard as the polynomial-time hierarchy
- (1991) SIAM J. Computing , vol.20 , pp. 865-877
- Toda, S.¹

28
- 0020828350
- Relativized circuit complexity
- (1985) J. Comput. System Sci. , vol.31 , Issue.2 , pp. 169-181
- Wilson, C.¹

29
- 0020301290
- Theory and applications of trapdoor functions
- IEEE Computer Society Press
- (1982) Proc. 23rd IEEE Symp. on the Foundations of Computer Science , pp. 80-91
- Yao, A.C.¹

30
- 0004413595
- Probabilistic quantifiers vs. distrustful adversaries
- Proc. 7th Conf. on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin
- (1987) Lecture Notes in Computer Science , vol.287 , pp. 443-455
- Zachos, S.¹ Fürer, M.²

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