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

메뉴 건너뛰기

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 887-905

Resource-bounded Kolmogorov complexity revisited

(3) Buhrman, Harry a Fortnow, Lance a Laplante, Sophie a

a CWI (Netherlands)

Author keywords

CD complexity; Computational complexity; Kolmogorov complexity

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

KOLMOGOROV COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0036308548 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S009753979834388X Document Type: Article

Times cited : (47)

References (29)

1
- 0003997240
- Springer-Verlag, Berlin
- (1988) Structural Complexity I
- Balcázar, J.¹ Díaz, J.² Gabarró, J.³

2
- 0032330820
- Functions computable with nonadaptive queries to NP
- (1998) Theory Comput. Syst. , vol.31 , pp. 77-92
- Buhrman, H.¹ Kadin, J.² Thierauf, T.³

3
- 0033714381
- New bounds for the language compression problem
- IEEE Computer Society Press, Los Alamitos, CA
- (2000) Proceedings of the 15th IEEE Conference on Computational Complexity , pp. 126-130
- Buhrman, H.¹ Laplante, S.² Miltersen, P.³

4
- 84948185164
- The complexity of generating and checking proofs of membership
- Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, C. Pueach and R. Reischuk, eds., Springer-Verlag, New York
- (1996) Lecture Notes in Comput. Sci. , vol.1046 , pp. 75-86
- Buhrman, H.¹ Thierauf, T.²

5
- 85059770931
- The complexity of theorem-proving procedures
- Shaker Heights, OH
- (1971) Proceedings of the 3rd ACM Symposium on the Theory of Computing , pp. 151-158
- Cook, S.¹

6
- 0002686104
- Classes of bounded nondeterminism
- (1990) Math. Systems Theory , vol.23 , pp. 21-32
- Díaz, J.¹ Torán, J.²

7
- 0021420540
- The complexity of promise problems with applications to public-key cryptography
- (1984) Inform. and Control , vol.61 , pp. 159-173
- Even, S.¹ Selman, A.L.² Yacobi, Y.³

8
- 0030182278
- On resource-bounded instance complexity
- (1996) Theoret. Comput. Sci. , vol.161 , pp. 123-140
- Fortnow, L.¹ Kummer, M.²

9
- 0009744436
- Polynomial-time compression
- (1992) Comput. Complexity , vol.2 , pp. 18-39
- Goldsmith, J.¹ Hemacrandra, L.² Kunen, K.³

10
- 0009750681
- Relativized isomorphisms of NP-complete sets
- (1993) Comput. Complexity , vol.3 , pp. 186-205
- Goldsmith, J.¹ Joseph, D.²

11
- 0009747204
- report TR97-045, Electronic Colloquium on Computational Complexity, University of Trier, Trier, Germany
- (1997) Another proof that BPP subseteq PH (and more)
- Goldreich, O.¹ Zuckerman, D.²

12
- 0001703687
- Computing solutions uniquely collapses the polynomial hierarchy
- (1996) SIAM J. Comput. , vol.25 , pp. 697-708
- Hemaspaandra, L.¹ Naik, A.² Ogihara, M.³ Selman, A.⁴

13
- 0003766834
- Oxford University Press, London
- (1979) An Introduction to the Theory of Numbers, 5th ed.
- Hardy, G.¹ Wright, E.²

14
- 0003254721
- The distribution of prime numbers
- Cambridge University Press, Cambridge, UK
- (1932) Cambridge Tracts in Mathematics and Mathematical Physics
- Ingham, A.¹

15
- 0024771883
- Decision versus search problems in super-polynomial time
- (1989) Proceedings of the 30th IEEE Symposium on Foundations of Computer Science , pp. 222-227
- Impagliazzo, R.¹ Tardos, G.²

16
- 0029287977
- Computing functions with parallel queries to NP
- (1995) Theoret. Comput. Sci. , vol.141 , pp. 175-193
- Jenner, B.¹ Torán, J.²

17
- 0003657594
- 2nd ed., Addison-Wesley, Reading, MA
- (1998) Sorting and Searching, The Art of Computer Programming, Sorting and Searching , vol.3
- Knuth, D.¹

18
- 0024020188
- The complexity of optimization problem
- (1988) J. Comput. System Sci. , vol.36 , pp. 490-509
- Krentel, M.¹

19
- 0003680739
- Springer-Verlag, New York
- (1997) An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed.
- Li, M.¹ Vitányi, P.²

20
- 0027208504
- More deterministic simulation in logspace
- (1993) Proceedings of the 25th ACM Symposium on the Theory of Computing , pp. 330-335
- Nisan, N.¹ Zuckerman, D.²

21
- 0002536854
- Functions computable with limited access to NP
- (1996) Inform. Process. Left , vol.58 , pp. 35-38
- Ogihara, M.¹

22
- 0029696657
- The complexity of knowledge representation
- Philadelphia, PA
- (1996) 11th Annual IEEE Conference on Computational Complexity
- Papadimitriou, C.¹

23
- 0032629108
- Extracting all the randomness and reducing the error in Trevisan's extractors
- (1999) Proceedings of the 29th ACM Symposium on the Theory of Computing , pp. 149-158
- Raz, R.¹ Reingold, O.² Vadhan, S.³

24
- 0020931594
- A complexity theoretic approach to randomness
- (1983) Proceedings of the 15th ACM Symposium on the Theory of Computing , pp. 330-335
- Sipser, M.¹

25
- 0029703427
- On extracting randomness from weak random sources (extended abstract)
- (1996) Proceedings of the 28th ACM Symposium on the Theory of Computing , pp. 276-285
- Ta-Shma, A.¹

26
- 0032624550
- Construction of extractors using pseudo-random generators
- (1999) Proceedings of the 29th ACM Symposium on the Theory of Computing , pp. 141-148
- Trevisan, L.¹

27
- 0022911518
- NP is as easy as detecting unique solutions
- (1986) Theoret. Comput. Sci. , vol.47 , pp. 85-93
- Valiant, L.G.¹ Vazirani, V.V.²

28
- 0001095148
- Structural analysis on the complexity of inverse functions
- (1993) Math. Systems Theory , vol.26 , pp. 203-214
- Watanabe, O.¹ Toda, S.²

29
- 0029703647
- Randomness-optimal sampling, extractors, and constructive leader election
- (1996) Proceedings of the 28th ACM Symposium on the Theory of Computing , pp. 286-295
- Zuckerman, D.¹

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