메뉴 건너뛰기




Volumn 1369 LNCS, Issue , 1998, Pages 1-24

Euclid, tarski, and engeler encompassed

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; POLYNOMIALS; QUERY PROCESSING;

EID: 0342959277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64823-2_1     Document Type: Conference Paper
Times cited : (3)

References (31)
  • 7
    • 85029837057 scopus 로고
    • Quantifier elimination for real closed fields by cylindrical algebraic decomposition
    • H. Brakhage, editor Berlin Springer-Verlag
    • G.E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In H. Brakhage, editor, Automata Theory and Formal Languages, Volume 33 of Lecture Notes in Computer Science, pages 134-183, Berlin, 1975. Springer-Verlag.
    • (1975) Automata Theory and Formal Languages, Volume 33 of Lecture Notes in Computer Science , pp. 134-183
    • Collins, G.E.1
  • 17
    • 0031076704 scopus 로고    scopus 로고
    • Queries with arithmetical constraints
    • S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173(1):151-181, 1997.
    • (1997) Theoretical Computer Science , vol.173 , Issue.1 , pp. 151-181
    • Grumbach, S.1    Su, J.2
  • 27
    • 0001572510 scopus 로고
    • On the computational complexity and geometry of the first-order theory of the reals
    • J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13:255-352, 1989.
    • (1989) Journal of Symbolic Computation , vol.13 , pp. 255-352
    • Renegar, J.1


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