메뉴 건너뛰기




Volumn 18, Issue 1, 1982, Pages 105-111

The complexity of presburger arithmetic with bounded quantifier alternation depth

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0001042546     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(82)90115-3     Document Type: Article
Times cited : (31)

References (10)
  • 5
    • 77956974423 scopus 로고
    • Bounded concatenation theory as a uniform method for proving lower complexity bounds
    • R.O. Gandy, J.M.E. Hyland, North-Holland, Amsterdam
    • (1977) Logic Colloquium 76 , pp. 471-490
    • Fleischmann1    Mahr2    Siefkes3
  • 8
    • 84918997465 scopus 로고
    • Untere Schranken für die Komplexität logischer Entscheidungsprobleme
    • E. Specker, V. Strassen, Lecture Notes in Computer Science, Springer, Berlin
    • (1976) Komplexität von Entscheidungsproblemen , vol.43 , pp. 127-137
    • Heintz1


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