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

메뉴 건너뛰기

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 906-918

Separation of NP-completeness notions

(2) Pavan, A a Selman, Alan L a

a NEC LABORATORIES AMERICA (United States)

Author keywords

Many one completeness; p genericity; p selectivity; Truth table completeness; Turing completeness

Indexed keywords

POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; TURING MACHINES;

NONTRIVIAL PROBABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0036304374 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539701387039 Document Type: Article

Times cited : (21)

References (31)

1
- 0024138281
- P-printable sets
- AR88
- (1988) SIAM J. Comput. , vol.17 , pp. 1193-1202
- Allender, E.W.¹ Rubinstein, R.S.²

2
- 0034514733
- Separating NP-completeness under strong hypotheses
- ASB00
- (2000) J. Comput. System Sci. , vol.61 , pp. 335-361
- Ambos-Spies, K.¹ Bentzien, L.²

3
- 0023501489
- Diagonalizations over polynomial time computable sets
- ASFH87
- (1987) Theoret. Comput. Sci. , vol.51 , pp. 177-204
- Ambos-Spies, K.¹ Fleischhack, H.² Huwig, H.³

4
- 0030289312
- Genericity and measure for exponential time
- ASNT96
- (1996) Theoret. Comput. Sci. , vol.168 , pp. 3-19
- Ambos-Spies, K.¹ Neis, H.² Terwijn, A.³

5
- 0001455590
- Relativizations of the P =? NP question
- BGS75
- (1975) SIAM J. Comput. , vol.4 , pp. 431-442
- Baker, T.¹ Gill, J.² Solovay, R.³

6
- 0022752632
- The polynomial-time hierarchy and sparse oracles
- BBS86
- (1986) J. ACM , vol.33 , pp. 603-617
- Balcázar, J.¹ Book, R.² Schöning, U.³

7
- 0002164637
- Bi-immune sets for complexity classes
- BS85
- (1985) Math. Systems Theory , vol.18 , pp. 1-10
- Balcázar, J.¹ Schöning, U.²

8
- 0029717041
- On inverting onto functions
- FFNR96
- (1996) Proceedings of the 11th annual IEEE Conference on Computational Complexity , pp. 213-223
- Fenner, S.¹ Fortnow, L.² Naik, A.³ Rogers, J.⁴

9
- 0035634529
- Distributionally hard languages
- FPS99
- (2001) Theory Comput. Syst. , vol.34 , pp. 245-262
- Fortnow, L.¹ Pavan, A.² Selman, A.³

10
- 84957694377
- Separability and one-way functions
- FR94, Proceedings of the Fifth International Symposium on Algorithms and Computation, D.Z. Du and X.S. Zhang, eds., Springer-Verlag, Berlin
- (1994) Lecture Notes in Comput. Sci. , vol.834 , pp. 396-404
- Fortnow, L.¹ Rogers, J.²

11
- 0026151774
- A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes
- GHS91
- (1991) Inform. Comput. , vol.92 , pp. 97-104
- Geske, J.¹ Huynh, D.² Seiferas, J.³

12
- 0000303380
- Discrete logarithms in GF(p) using the number field sieve
- Gor93
- (1993) SIAM Journal on Discrete Mathematics , vol.6 , pp. 124-138
- Gordon, D.¹

13
- 0023985540
- Complexity measures for public-key cryptosystems
- GS88
- (1988) SIAM J. Comput. , vol.17 , pp. 309-335
- Grollmann, J.¹ Selman, A.L.²

14
- 0027625347
- On 1-truth-table-hard languages
- HKR93
- (1993) Theoret. Comput. Sci. , vol.115 , pp. 383-389
- Homer, S.¹ Kurtz, S.² Royer, J.³

15
- 0028406512
- On reductions of NP sets to sparse sets
- HL94
- (1994) J. Comput. System Sci. , vol.48 , pp. 324-336
- Homer, S.¹ Longpré, L.²

16
- 0030263710
- P-selective sets and reducing search to decision vs. self-reducibility
- HNOS96
- (1996) J. Comput. System Sci. , vol.53 , pp. 194-209
- Hemaspaandra, E.¹ Naik, A.² Ogiwara, M.³ Selman, A.⁴

17
- 0031269021
- Easy sets and hard certificate schemes
- HRW97
- (1997) Acta Inform. , vol.34 , pp. 859-879
- Hemaspaandra, L.¹ Rothe, J.² Wechsung, G.³

18
- 84968502725
- On the computational complexity of algorithms
- HS65
- (1965) Trans. Amer. Math. Soc. , vol.117 , pp. 285-306
- Hartmanis, J.¹ Stearns, R.²

19
- 0020848740
- Computation times of NP sets of different densities
- HY84
- (1984) Theoret. Comput. Sci. , vol.34 , pp. 17-32
- Hartmanis, J.¹ Yesha, Y.²

20
- 0001058046
- Completeness, approximation and density
- KM81
- (1981) SIAM J. Comput. , vol.10 , pp. 787-796
- Ko, K.¹ Moore, D.²

21
- 0000423879
- A comparison of polynomial time reducibilities
- LLS75
- (1975) Theoret. Comput. Sci. , vol.1 , pp. 103-123
- Ladner, R.¹ Lynch, N.² Selman, A.³

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

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

24
- 0025623315
- Cook reducibility is faster than Karp reducibility
- LY90
- (1990) J. Comput. System Sci. , vol.41 , pp. 389-401
- Longpré, L.¹ Young, P.²

25
- 0026173960
- On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
- OW91
- (1991) SIAM J. Comput. , vol.20 , pp. 471-483
- Ogiwara, M.¹ Watanabe, O.²

26
- 0009705203
- RW01, private communication
- Regan, K.¹ Watanabe, O.²

27
- 0002973163
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
- Sel79
- (1979) Mathematical Systems Theory , vol.13 , pp. 55-65
- Selman, A.¹

28
- 0000414606
- Reductions on NP and P-selective sets
- Sel82
- (1982) Theoret. Comput. Sci. , vol.19 , pp. 287-304
- Selman, A.¹

29
- 0002698373
- On polynomial-time truth-table reducibilities of intractable sets to P-selective sets
- Tod91
- (1991) Math. Systems Theory , vol.24 , pp. 69-82
- Toda, S.¹

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

31
- 0023437255
- A comparison of polynomial time completeness notions
- Wat87
- (1987) Theoret. Comput. Sci. , vol.54 , pp. 249-265
- Watanabe, O.¹

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