메뉴 건너뛰기




Volumn 284, Issue 1, 1984, Pages 203-218

Complexity of subcases of presburger arithmetic

Author keywords

Complexity of decidable theories; Complexity of formulas; Lower bounds for lengths of formulas; NP hard problems; Presburger arithmetic; Quantifier elimination

Indexed keywords


EID: 0008953949     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0002-9947-1984-0742421-9     Document Type: Article
Times cited : (62)

References (14)
  • 1
    • 0041154689 scopus 로고
    • NP-complete decision problems for binary’ quadratics
    • L. Adleman and K. Manders, NP-complete decision problems for binary’ quadratics, J. Comput. System Sci. 16 (1978), 168-184.
    • (1978) J. Comput. System Sci , vol.16 , pp. 168-184
    • Adleman, L.1    Manders, K.2
  • 2
    • 0003083237 scopus 로고
    • Theorem proving in arithmetic without multiplication
    • D. C. Cooper, Theorem proving in arithmetic without multiplication, Machine Intelligence Workshop 7(1972), 91-100.
    • (1972) Machine Intelligence Workshop , vol.7 , pp. 91-100
    • Cooper, D.C.1
  • 3
    • 0003224818 scopus 로고
    • The computational complexity of logical theories
    • Springer-Verlag, Berlin and New York
    • J. Ferrante and C. W. Rackoff, The computational complexity of logical theories, Lecture Notes in Math., vol. 718, Springer-Verlag, Berlin and New York, 1979.
    • (1979) Lecture Notes in Math. , vol.718
    • Ferrante, J.1    Rackoff, C.W.2
  • 4
    • 0001042546 scopus 로고
    • The complexity of Presburger arithmetic with bounded quantifier alternation
    • M. Fiirer, The complexity of Presburger arithmetic with bounded quantifier alternation, Theoret. Comput. Sci. 18(1982), 105-111.
    • (1982) Theoret. Comput. Sci , vol.18 , pp. 105-111
    • Fiirer, M.1
  • 5
    • 0002202224 scopus 로고
    • Super-exponential complexity of Presburger arithmetic
    • Amer. Math. Soc., Providence, R. I
    • M. J. Fischer and M. O. Rabin, Super-exponential complexity of Presburger arithmetic, Proc. Sympos. Pure Math., vol. 7, Amer. Math. Soc., Providence, R. I., 1974.
    • (1974) Proc. Sympos. Pure Math. , vol.7
    • Fischer, M.J.1    Rabin, M.O.2
  • 6
    • 84967738936 scopus 로고
    • Polynomial beschrankte nichtdeterministische Turingmaschinen und die Vollstandigkeit des aussagenlogischen Erfullungsproblems
    • A. Haussler, Polynomial beschrankte nichtdeterministische Turingmaschinen und die Vollstandigkeit des aussagenlogischen Erfullungsproblems, Lecture Notes in Comput. Sci. 43 (1976), 20-35.
    • (1976) Lecture Notes in Comput. Sci , vol.43 , pp. 20-35
    • Haussler, A.1
  • 7
    • 84918997465 scopus 로고
    • Untere Schranken fur die Komplexitat logischer Entscheidungs-probleme
    • J. Heintz, Untere Schranken fur die Komplexitat logischer Entscheidungs-probleme. Lecture Notes in Comput. Sci. 43 (1976), 127-137.
    • (1976) Lecture Notes in Comput. Sci , vol.43 , pp. 127-137
    • Heintz, J.1
  • 8
    • 77956967799 scopus 로고
    • Lengths of formulas and elimination of quantifiers, Contributions to Math
    • L. Hodes and E. Specker, Lengths of formulas and elimination of quantifiers, Contributions to Math. Logic (1968), 175-188.
    • (1968) Logic , pp. 175-188
    • Hodes, L.1    Specker, E.2
  • 10
    • 84967777191 scopus 로고
    • Ueber die Vollstandigkeit eines gewissen Systems ganzer Zahlen, Comptes Rendus, I
    • Warsaw
    • M. Presburger, Ueber die Vollstandigkeit eines gewissen Systems ganzer Zahlen, Comptes Rendus, I. Congres des Math, des Pays Slaves, Warsaw, 1929, pp. 192-201.
    • (1929) Congres Des Math, Des Pays Slaves , pp. 192-201
    • Presburger, M.1
  • 12
    • 84885799315 scopus 로고
    • Weitere zum Erfullungsproblem polynomial dquivalente kom- binatorische A ufgaben
    • M. Sieveking and J. V. Z. Gathen, Weitere zum Erfullungsproblem polynomial dquivalente kom- binatorische A ufgaben, Lecture Notes in Comput. Sci. 43 (1976), 49-71.
    • (1976) Lecture Notes in Comput. Sci , vol.43 , pp. 49-71
    • Sieveking, M.1    Gathen, J.V.Z.2
  • 13
    • 84966251218 scopus 로고
    • A bound on solutions of linear integer equalities and inequalities
    • M. Sieveking and J. V. Z. Gathen, A bound on solutions of linear integer equalities and inequalities, Proc. Amer. Math. Soc. 72 (1978), 155-158.
    • (1978) Proc. Amer. Math. Soc , vol.72 , pp. 155-158
    • Sieveking, M.1    Gathen, J.V.Z.2


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