메뉴 건너뛰기




Volumn 67, Issue 3, 2002, Pages 1093-1125

On polynomial time computation over unordered structures

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0036745472     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1190150152     Document Type: Article
Times cited : (57)

References (21)
  • 3
    • 0021520840 scopus 로고
    • Equivalence relations, invariants, and normal forms
    • _, Equivalence relations, invariants, and normal forms, SIAM Journal on Computing, vol. 13 (1984), pp. 682-689.
    • (1984) SIAM Journal on Computing , vol.13 , pp. 682-689
  • 4
    • 85010808611 scopus 로고
    • Equivalence relations, invariants, and normal forms
    • II, Logic and Machines: Decision Problems and Complexity, Springer-Verlag
    • _, Equivalence relations, invariants, and normal forms, II, Logic and Machines: Decision Problems and Complexity (E. Börger, G. Hasenjaeger, and D. Rödding, editors), Lecture Notes in Computer Science, vol. 171, Springer-Verlag, 1984, pp. 24-42.
    • (1984) Lecture Notes in Computer Science , vol.171 , pp. 24-42
    • Börger, E.1    Hasenjaeger, G.2    Rödding, D.3
  • 5
    • 23044519294 scopus 로고    scopus 로고
    • Abstract state machines and computationally complete query languages
    • Information and Computation, An abridged version appeared in Abstract State Machines: Theory and Applications, Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Spinger-Verlag
    • A. Blass, Y. Gurevich, and J.V. Den Bussche, Abstract state machines and computationally complete query languages, Information and Computation, An abridged version appeared in Abstract State Machines: Theory and Applications, (Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors), Lecture Notes in Computer Science, vol. 1912, Spinger-Verlag, 2000, pp. 22-33.
    • (2000) Lecture Notes in Computer Science , vol.1912 , pp. 22-33
    • Blass, A.1    Gurevich, Y.2    Den Bussche, J.V.3
  • 8
    • 0000409564 scopus 로고
    • An optimal lower bound on the number of variables for graph identification
    • J.Y. Cai, M. Fürer, and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica, vol. 12 (1992), pp. 389-410.
    • (1992) Combinatorica , vol.12 , pp. 389-410
    • Cai, J.Y.1    Fürer, M.2    Immerman, N.3
  • 10
    • 0003084790 scopus 로고    scopus 로고
    • An extension of fixpoint logic with a symmetry-based choice construct
    • F. Gire and H.K. Hoang, An extension of fixpoint logic with a symmetry-based choice construct, Information and Computation, vol. 144 (1998), pp. 40-65.
    • (1998) Information and Computation , vol.144 , pp. 40-65
    • Gire, F.1    Hoang, H.K.2
  • 12
    • 0002041360 scopus 로고
    • Logic and the challenge of computer science
    • E. Börger, editor, Computer Science Press
    • Y. Gurevich, Logic and the challenge of computer science, Current trends in theoretical computer science (E. Börger, editor), Computer Science Press, 1988, pp. 1-57.
    • (1988) Current trends in theoretical computer science , pp. 1-57
    • Gurevich, Y.1
  • 13
    • 0002017107 scopus 로고
    • Evolving algebras 1993: Lipari guide
    • Oxford University Press
    • _, Evolving algebras 1993: Lipari guide, Specification and validation methods (E. Börger, editor), Oxford University Press, 1995, pp. 9-36.
    • (1995) Specification and validation methods , pp. 9-36
    • Börger, E.1
  • 14
    • 38149092296 scopus 로고    scopus 로고
    • From invariants to canonization
    • _, From invariants to canonization, Bulletin of the European Association on Theoretical Computer Science, vol. 63 (1997), Also as Logic in Computer Science, in Current trends in theoretical computer science: Entering the 21st century, (G. Paun, G. Rozenberg and A. Salomaa, editors), World Scientific, 2001, pp. 233-436.
    • (1997) Bulletin of the European Association on Theoretical Computer Science , vol.63
  • 18
    • 0022500426 scopus 로고
    • Relational queries computable in polynomial time
    • N. Immerman, Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86-104.
    • (1986) Information and Control , vol.68 , pp. 86-104
    • Immerman, N.1
  • 19
    • 0010699148 scopus 로고    scopus 로고
    • Bounded variable logics and counting: A study infinite models
    • Springer-Verlag
    • M. Otto, Bounded variable logics and counting: A study infinite models, Lecture Notes in Logic, vol. 9, Springer-Verlag, 1997.
    • (1997) Lecture Notes in Logic , vol.9
    • Otto, M.1
  • 20
    • 0001894545 scopus 로고    scopus 로고
    • Choiceless polynomial time logic: Inability to express
    • Computer Science Logic 2000, P. Clote and H. Schwichtenberg, editors, Springer-Verlag, paper number 634
    • S. Shelah, Choiceless polynomial time logic: Inability to express, Computer Science Logic 2000 (P. Clote and H. Schwichtenberg, editors), Lecture Notes in Computer Science, vol. 1862, Springer-Verlag, 2000, paper number 634, pp. 72-125.
    • (2000) Lecture Notes in Computer Science , vol.1862 , pp. 72-125
    • Shelah, S.1


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