메뉴 건너뛰기




Volumn 2697, Issue , 2003, Pages 202-211

On proving circuit lower bounds against the polynomial-time hierarchy: Positive and negative results

Author keywords

[No Author keywords available]

Indexed keywords

TIMING CIRCUITS;

EID: 35248899363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_22     Document Type: Article
Times cited : (5)

References (15)
  • 3
    • 0039341370 scopus 로고
    • With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
    • ACM
    • J-Y. Cai, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy, in Proc. 18th ACM Symposium on Theory of Computing (STOC'86), ACM, 21-29, 1986.
    • (1986) Proc. 18th ACM Symposium on Theory of Computing (STOC'86) , pp. 21-29
    • Cai, J.-Y.1
  • 4
    • 1842505229 scopus 로고
    • journal version appeared
    • See also the journal version appeared in J. Comput. and System Sci. 38(1): 68-85 (1989).
    • (1989) J. Comput. and System Sci. , vol.38 , Issue.1 , pp. 68-85
  • 6
    • 84855625726 scopus 로고    scopus 로고
    • Research Report C-167, Dept. of Math. Comput. Sci., Tokyo Inst. of Tech.
    • J-Y. Cai and O. Watanabe, Research Report C-167, Dept. of Math. Comput. Sci., Tokyo Inst. of Tech., 2003. Available from www.is.titech.ac.jp/research/research-report/C/index.html.
    • (2003)
    • Cai, J.-Y.1    Watanabe, O.2
  • 9
    • 0021518814 scopus 로고
    • On relativized polynomial and exponential computations
    • H. Heller, On relativized polynomial and exponential computations, SIAM J. Comput. 13(4), 717-725, 1984.
    • (1984) SIAM J. Comput. , vol.13 , Issue.4 , pp. 717-725
    • Heller, H.1
  • 10
    • 0343474117 scopus 로고
    • Circuit-size lower bounds and non-reducibility to sparse sets
    • R. Kannan, Circuit-size lower bounds and non-reducibility to sparse sets, Information and Control, 55, 40-56, 1982.
    • (1982) Information and Control , vol.55 , pp. 40-56
    • Kannan, R.1
  • 12
    • 0040061529 scopus 로고    scopus 로고
    • New collapse consequences of NP having small circuits
    • J. Köbler and O. Watanabe, New collapse consequences of NP having small circuits, SIAM J. Comput., 28, 311-324, 1998.
    • (1998) SIAM J. Comput. , vol.28 , pp. 311-324
    • Köbler, J.1    Watanabe, O.2
  • 13
    • 84957811473 scopus 로고    scopus 로고
    • Super-Polynomial versus half-exponential circuit size in the exponential hierarchy
    • Proc. 5th Annual International Conference on Computing and Combinatorics (COCOON'99)
    • P.B. Miltersen, N.V. Vinodchandran, and O. Watanabe, Super-Polynomial versus half-exponential circuit size in the exponential hierarchy, in Proc. 5th Annual International Conference on Computing and Combinatorics (COCOON'99), Lecture Notes in Computer Science 1627, 210-220, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1627 , pp. 210-220
    • Miltersen, P.B.1    Vinodchandran, N.V.2    Watanabe, O.3


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