메뉴 건너뛰기




Volumn 2, Issue , 2014, Pages 974-980

The computational complexity of structure-based causality

Author keywords

[No Author keywords available]

Indexed keywords

STRUCTURE-BASED;

EID: 84908150555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (22)
  • 5
    • 0036837713 scopus 로고    scopus 로고
    • Complexity results for structure-based causality
    • Eiter, T., and Lukasiewicz, T. 2002. Complexity results for structure-based causality. Artificial Intelligence 142(1):53- 89.
    • (2002) Artificial Intelligence , vol.142 , Issue.1 , pp. 53-89
    • Eiter, T.1    Lukasiewicz, T.2
  • 6
    • 77249104421 scopus 로고    scopus 로고
    • Spreading the blame: The allocation of responsibility amongst multiple agents
    • Gerstenberg, T., and Lagnado, D. 2010. Spreading the blame: The allocation of responsibility amongst multiple agents. Cognition 115:166-171.
    • (2010) Cognition , vol.115 , pp. 166-171
    • Gerstenberg, T.1    Lagnado, D.2
  • 7
    • 16644390593 scopus 로고    scopus 로고
    • Two concepts of causation
    • Collins, J. Hall, N. and Paul, L. A. eds., Cambridge, Mass.: MIT Press
    • Hall, N. 2004. Two concepts of causation. In Collins, J.; Hall, N.; and Paul, L. A., eds., Causation and Counterfactuals. Cambridge, Mass.: MIT Press.
    • (2004) Causation and Counterfactuals
    • Hall, N.1
  • 9
    • 29144510111 scopus 로고    scopus 로고
    • Causes and explanations: A structural-model approach. Part i: Causes
    • Halpern, J. Y., and Pearl, J. 2005. Causes and explanations: A structural-model approach. Part I: Causes. British Journal for Philosophy of Science 56{4):843-887.
    • (2005) British Journal for Philosophy of Science , vol.56 , Issue.4 , pp. 843-887
    • Halpern, J.Y.1    Pearl, J.2
  • 14
    • 0029287977 scopus 로고
    • Computing functions with parallel queries to np
    • Jenner, B., and Toran, J. 1995. Computing functions with parallel queries to NP. Theoretical Computer Science 141:175-193.
    • (1995) Theoretical Computer Science , vol.141 , pp. 175-193
    • Jenner, B.1    Toran, J.2
  • 15
    • 0001951331 scopus 로고
    • A catalog of complexity classes
    • Leeuwen, J. v. ed., Elsevier Science, chapter 2
    • Johnson, D. S. 1990. A catalog of complexity classes. In Leeuwen, J. v., ed., Handbook of Theoretical Computer Science, volume A. Elsevier Science, chapter 2.
    • (1990) Handbook of Theoretical Computer Science , vol.A
    • Johnson, D.S.1
  • 16
  • 17
    • 84985359842 scopus 로고
    • The equivalence problem for regular expressions with squaring requires exponential time
    • Meyer, A., and Stockmeyer, L. 1972. The equivalence problem for regular expressions with squaring requires exponential time. In Proc. 13th IEEE Symp. on Switching and Automata Theory, 125-129.
    • (1972) Proc. 13th IEEE Symp. on Switching and Automata Theory , pp. 125-129
    • Meyer, A.1    Stockmeyer, L.2
  • 18
    • 0021406238 scopus 로고
    • The complexity of facets (and some facets of complexity)
    • Papadimitriou, C. H., and Yannakakis, M. 1984. The complexity of facets (and some facets of complexity). J. Comput. Syst. Sci. 28(2):244-259.
    • (1984) J. Comput. Syst. Sci. , vol.28 , Issue.2 , pp. 244-259
    • Papadimitriou, C.H.1    Yannakakis, M.2
  • 19
    • 0021417820 scopus 로고
    • The complexity of unique solutions
    • Papadimitriou, C. H. 1984. The complexity of unique solutions. Journal of ACM 31:492-500.
    • (1984) Journal of ACM , vol.31 , pp. 492-500
    • Papadimitriou, C.H.1


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