메뉴 건너뛰기




Volumn 1683, Issue , 1999, Pages 67-81

Descriptive complexity theory for constraint databases

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER CIRCUITS; DIGITAL ARITHMETIC;

EID: 84949464490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_6     Document Type: Conference Paper
Times cited : (13)

References (15)
  • 2
    • 0023984103 scopus 로고
    • Subclasses of Presburger arithmetic and the polynomial-timehierarchy
    • E. Grädel. Subclasses of Presburger arithmetic and the polynomial-time hierarchy. Theoretical Computer Science, 56:289-301, 1988. 71, 71, 72
    • (1988) Theoretical Computer Science , vol.56 , pp. 289-301
    • Grädel, E.1
  • 6
    • 0031076704 scopus 로고    scopus 로고
    • Queries with arithmetical constraints
    • S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173:151-181, 1997. 68, 68
    • (1997) Theoreticalcomputer Science , vol.173 , pp. 151-181
    • Grumbach, S.1    Su, J.2
  • 7
    • 84957696891 scopus 로고
    • Linear constraint query languages: Expressive power and complexity
    • S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. Lecture Notes in Computer Science, 960:426-446, 1995. 70
    • (1995) Lecture Notes in Computer Science , vol.960 , pp. 426-446
    • Grumbach, S.1    Su, J.2    Tollu, C.3
  • 8
    • 84896776688 scopus 로고    scopus 로고
    • of Lecture Notes in Computer Science, Springer
    • D. Harel. Towards a theory of recursive structures. volume 1450 of Lecture Notes in Computer Science, pages 36-53. Springer, 1998. 68
    • (1998) Towards a Theory of Recursive Structures , vol.1450 , pp. 36-53
    • Harel, D.1
  • 9
    • 0004240663 scopus 로고
    • Cambridge University Press
    • W. Hodges. Model Theory. Cambridge University Press, 1993. 78
    • (1993) Model Theory
    • Hodges, W.1
  • 10
    • 0004226070 scopus 로고    scopus 로고
    • Graduate Texts in Computer Science.Springer
    • N. Immerman. Descriptive complexity. Graduate Texts in Computer Science. Springer, 1998. 67, 80
    • (1998) Descriptive Complexity
    • Immerman, N.1
  • 14
    • 0027906169 scopus 로고
    • A closed form evaluation for datalog queries with integer (Gap)-order constraints
    • P. Revesz. A closed form evaluation for datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 116:117-149, 1993. 80
    • (1993) Theoretical Computer Science , vol.116 , pp. 117-149
    • Revesz, P.1
  • 15
    • 0038877596 scopus 로고    scopus 로고
    • Complexity of Presburger arithmetic with fixed quantifier dimension
    • U. Schaning. Complexity of Presburger arithmetic with fixed quantifier dimension. Theory of Computing Systems, 30:423-428, 1997. 71, 72
    • (1997) Theory of Computing Systems , vol.30 , pp. 423-428
    • Scöhaning, U.1


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