메뉴 건너뛰기




Volumn , Issue , 1997, Pages 2-12

Six hypotheses in search of a theorem

Author keywords

[No Author keywords available]

Indexed keywords

P-SELECTIVE; TRUTH TABLES;

EID: 0002443042     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1997.612295     Document Type: Conference Paper
Times cited : (11)

References (50)
  • 1
    • 0030148428 scopus 로고    scopus 로고
    • Quasi-linear truth-table reductions to p-selective sets
    • M. Agrawal and V. Arvind. Quasi-linear truth-table reductions to p-selective sets. Theoretical Computer Science, 158: 361370, 1996.
    • (1996) Theoretical Computer Science , vol.158 , pp. 361370
    • Agrawal, M.1    Arvind, V.2
  • 3
    • 85058131016 scopus 로고    scopus 로고
    • R. Beigel, H. Buhrman, and L. Fortnow, 1997. Manuscript
    • R. Beigel, H. Buhrman, and L. Fortnow, 1997. Manuscript.
  • 8
    • 0023168472 scopus 로고
    • A structural theorem that depends quantitatively on the complexity of SAT
    • IEEE Computer Science Press
    • R. Beigel. A structural theorem that depends quantitatively on the complexity of SAT. In Proceedings of the 2nd conference on Structure in Complexity Theory, pages 28-32. IEEE Computer Science Press, 1987.
    • (1987) Proceedings of the 2nd Conference on Structure in Complexity Theory , pp. 28-32
    • Beigel, R.1
  • 12
    • 0001455590 scopus 로고
    • Rel-ativizations of the P NP question
    • Dec.
    • T. Baker, J. Gill, and R. Solovay. Rel-ativizations of the P NP question. SIAM J. Comput., 4 (4): 431-441, Dec. 1975.
    • (1975) SIAM J. Comput. , vol.4 , Issue.4 , pp. 431-441
    • Baker, T.1    Gill, J.2    Solovay, R.3
  • 13
    • 0001388818 scopus 로고
    • On isomorphisms and density of NP and other complete sets
    • L. Berman and H. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comput., 6: 305322, 1977.
    • (1977) SIAM J. Comput. , vol.6 , pp. 305322
    • Berman, L.1    Hartmanis, H.2
  • 14
    • 0026123004 scopus 로고
    • On truth-table re-ducibility to SAT
    • February
    • S. R. Buss and L. Hay. On truth-table re-ducibility to SAT. Information and Computation, 90 (2): 86-102, February 1991.
    • (1991) Information and Computation , vol.90 , Issue.2 , pp. 86-102
    • Buss, S.R.1    Hay, L.2
  • 17
    • 0039933698 scopus 로고
    • A second step toward the polynomial hierarchy
    • Baker and Selman. A second step toward the polynomial hierarchy. Theoretical Computer Science, 8, 1979.
    • (1979) Theoretical Computer Science , pp. 8
    • Baker1    Selman2
  • 19
    • 0030262606 scopus 로고    scopus 로고
    • P-selective self-reducible sets: A new characterization of P
    • H. Buhrman and L. Torenvliet. P-selective self-reducible sets: A new characterization of P. J. Computer and System Sciences, 53 (2): 210-217, 1996.
    • (1996) J. Computer and System Sciences , vol.53 , Issue.2 , pp. 210-217
    • Buhrman, H.1    Torenvliet, L.2
  • 25
    • 0009750681 scopus 로고
    • Relativized isomorphisms of NP-complete sets
    • J. Goldsmith and D. Joseph. Relativized isomorphisms of NP-complete sets. Computational Complexity, 3: 186-205, 1993.
    • (1993) Computational Complexity , vol.3 , pp. 186-205
    • Goldsmith, J.1    Joseph, D.2
  • 30
    • 0029287977 scopus 로고
    • Computing functions with parallel queries to NP
    • Jenner and Toran. Computing functions with parallel queries to NP. Theoretical Computer Science, 141, 1995.
    • (1995) Theoretical Computer Science , pp. 141
    • Jenner1    Toran2
  • 32
    • 0002716212 scopus 로고
    • Refining non-determinism in relativized poslynomial-time bounded computations
    • C. Kintala and P. Fischer. Refining non-determinism in relativized poslynomial-time bounded computations. SIAM J. Comput, 9 (1): 46-53, 1980.
    • (1980) SIAM J. Comput , vol.9 , Issue.1 , pp. 46-53
    • Kintala, C.1    Fischer, P.2
  • 33
    • 84944053247 scopus 로고
    • Some connections between nonuniform and uniform complexity classes
    • R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proc. 12th ACM Symposium on Theory of Computing, pages 302-309, 1980.
    • (1980) Proc. 12th ACM Symposium on Theory of Computing , pp. 302-309
    • Karp, R.1    Lipton, R.2
  • 34
    • 0020737382 scopus 로고
    • On self-reducibility and weak P-selectivity
    • K.-I. Ko. On self-reducibility and weak P-selectivity. J. Comput. System Set., 26: 209-211, 1983.
    • (1983) J. Comput. System Set. , vol.26 , pp. 209-211
    • Ko, K.-I.1
  • 35
    • 0012942598 scopus 로고
    • Technical Report 21/91, Fakultat fur Infor-matik, Universitat Karlsruhe, Karlsruhe
    • M. Kummer and F. Stephan. Some aspects of frequency computation. Technical Report 21/91, Fakultat fur Infor-matik, Universitat Karlsruhe, Karlsruhe, 1991.
    • (1991) Some Aspects of Frequency Computation
    • Kummer, M.1    Stephan, F.2
  • 37
    • 0000359018 scopus 로고
    • Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
    • S. Mahaney. Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. J. Comput. System Sci., 25: 130-143, 1982.
    • (1982) J. Comput. System Sci. , vol.25 , pp. 130-143
    • Mahaney, S.1
  • 38
    • 0029538097 scopus 로고
    • Polynomial-time membership comparable sets
    • M. Ogihara. Polynomial-time membership comparable sets. SIAM Journal on Computing, 24 (5): 1168-1181, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , Issue.5 , pp. 1168-1181
    • Ogihara, M.1
  • 39
    • 0026173960 scopus 로고
    • On polynomial time bounded truth-table re-ducibility of NP sets to sparse sets
    • M. Ogiwara and O. Watanabe. On polynomial time bounded truth-table re-ducibility of NP sets to sparse sets. SIAM J. Comput, 20: 471-483, 1991.
    • (1991) SIAM J. Comput , vol.20 , pp. 471-483
    • Ogiwara, M.1    Watanabe, O.2
  • 41
    • 0002973163 scopus 로고
    • P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
    • A. Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Math. Systems Theory, 13: 55-65, 1979.
    • (1979) Math. Systems Theory , vol.13 , pp. 55-65
    • Selman, A.1
  • 42
    • 0040061527 scopus 로고
    • Analogues of semicursive sets and effective reducibilities to the study of NP complexity
    • January
    • A. Selman. Analogues of semicursive sets and effective reducibilities to the study of NP complexity. Information and Control, 52 (1): 36-51, January 1982.
    • (1982) Information and Control , vol.52 , Issue.1 , pp. 36-51
    • Selman, A.1
  • 44
    • 84972576948 scopus 로고
    • A combinatorial problem; Stability and order for models and theories in infinitary languages
    • S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific Journal of Mathematics, 41: 241-261, 1972.
    • (1972) Pacific Journal of Mathematics , vol.41 , pp. 241-261
    • Shelah, S.1
  • 45
    • 0002698373 scopus 로고
    • On polynomial-time truth-table reducibility of intractable sets to p-selective sets
    • S. Toda. On polynomial-time truth-table reducibility of intractable sets to p-selective sets. Math. Systems Theory, 24: 69-82, 1991.
    • (1991) Math. Systems Theory , vol.24 , pp. 69-82
    • Toda, S.1
  • 46
    • 0026239342 scopus 로고
    • PP is as hard as the polynomial-time hierarchy
    • S. Toda. PP is as hard as the polynomial-time hierarchy. SI AM Journal on Computing, 20 (5): 865-877, 1991.
    • (1991) SI AM Journal on Computing , vol.20 , Issue.5 , pp. 865-877
    • Toda, S.1
  • 47
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies of events to their probabilities
    • V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16 (2): 264-280, 1971.
    • (1971) Theory of Probability and Its Applications , vol.16 , Issue.2 , pp. 264-280
    • Vapnik, V.N.1    Chervonenkis, A.Ya.2
  • 49
    • 0025507099 scopus 로고
    • Bounded query classes
    • K. Wagner. Bounded query classes. SI AM Journal on Computing, 19 (5): 833-846, 1990.
    • (1990) SI AM Journal on Computing , vol.19 , Issue.5 , pp. 833-846
    • Wagner, K.1
  • 50
    • 0001095148 scopus 로고
    • Structural analysis on the complexity of inverse functions
    • O. Watanabe and S. Toda. Structural analysis on the complexity of inverse functions. Mathematical Systems Theory, 26: 203-214, 1993.
    • (1993) Mathematical Systems Theory , vol.26 , pp. 203-214
    • Watanabe, O.1    Toda, S.2


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