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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 244, Issue 1-2, 2000, Pages 283-288

The zero-one law holds for ℬ℘℘

(1) Van Melkebeek, Dieter a

a RUTGERS UNIVERSITY (United States)

Author keywords

Computational complexity; Derandomization; Resource bounded measure; Theory of computation; Zero one law

Indexed keywords

EID: 0042420016 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00191-2 Document Type: Article

Times cited : (9)

References (10)

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

2
- 0003335813
- Structural complexity II
- Springer, Berlin
- J. Balcázar, J. Díaz, J. Gabarró, Structural complexity II, Vol. 22, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1990.
- EATCS Monographs on Theoretical Computer Science , vol.22 , pp. 1990
- Balcázar, J.¹ Díaz, J.² Gabarró, J.³

3
- 0003367463
- Structural complexity I
- Springer, Berlin
- J. Balcázar, J. Díaz, J. Gabarró, Structural complexity I, Vol. 11, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1995.
- (1995) EATCS Monographs on Theoretical Computer Science , vol.11
- Balcázar, J.¹ Díaz, J.² Gabarró, J.³

4
- 84951093783
- Results on resource-bounded measure
- Proc. 24th Internat. Colloq. On Automata, Languages and Programming, Springer, Berlin
- H. Buhrman, S. Fenner, L. Fortnow, Results on resource-bounded measure, Proc. 24th Internat. Colloq. On Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 188-194.
- (1997) Lecture Notes in Computer Science , vol.1256 , pp. 188-194
- Buhrman, H.¹ Fenner, S.² Fortnow, L.³

5
- 0032314332
- Randomness vs. time: De-randomization under a uniform assumption
- IEEE
- R. Impagliazzo, A. Wigderson, Randomness vs. time: De-randomization under a uniform assumption, Proc. 39th IEEE Symp. on Foundations of Computer Science, IEEE, 1998, pp. 734-743.
- (1998) Proc. 39th IEEE Symp. on Foundations of Computer Science , pp. 734-743
- Impagliazzo, R.¹ Wigderson, A.²

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

7
- 0000923207
- The quantitative structure of exponential time
- L. Hemaspaandra, A. Selman (Eds.), Springer, Berlin
- J. Lutz, The quantitative structure of exponential time, in: L. Hemaspaandra, A. Selman (Eds.), Complexity Theory Retrospective II, Springer, Berlin, 1997, pp. 225-260.
- (1997) Complexity Theory Retrospective II , pp. 225-260
- Lutz, J.¹

8
- 0028484111
- Measure, stochasticity, and the density of hard languages
- J. Lutz, E. Mayordomo, Measure, stochasticity, and the density of hard languages, SIAM J. Comput. 23 (1994) 762-779.
- (1994) SIAM J. Comput. , vol.23 , pp. 762-779
- Lutz, J.¹ Mayordomo, E.²

9
- 0003897694
- Addison-Wesley, Reading, MA
- C. Papadimitriou, Computational Complexity., Addison-Wesley, Reading, MA, 1994.
- Computational Complexity , pp. 1994
- Papadimitriou, C.¹

10
- 0029510687
- Pseudorandom generators, measure theory, and natural proofs
- IEEE, New York
- K. Regan, D. Sivakumar, J. Cai, Pseudorandom generators, measure theory, and natural proofs, Proc. 36th IEEE Symp. on Foundations of Computer Science, IEEE, New York, 1995, pp. 26-35
- (1995) Proc. 36th IEEE Symp. on Foundations of Computer Science , pp. 26-35
- Regan, K.¹ Sivakumar, D.² Cai, J.³

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