The complexity of presburger arithmetic with bounded quantifier alternation depth

An introduction to the theory of numbers

Journal of the Franklin Institute · 1960 · 3.7K citations

Natural Sciences, Mathematics, Algebra +8

Bounds on positive integral solutions of linear Diophantine equations

I. Borosh, L. B. Treybig · Proceedings of the American Mathematical Society · 1976 · 208 citations · Full text

Natural Sciences, Mathematics, Algorithms +6

A Decision Procedure for the First Order Theory of Real Addition with Order

Jeanne Ferrante, Charles Rackoff · SIAM Journal on Computing · 1975 · 187 citations · Full text

Computing, Computer Science, Mathematics +7

The complexity of logical theories

L. Berman · Theoretical Computer Science · 1980 · 147 citations

Computing, Computer Science, Philosophy +12

A bound on solutions of linear integer equalities and inequalities

Joachim von zur Gathen, Malte Sieveking · Proceedings of the American Mathematical Society · 1978 · 137 citations

Natural Sciences, Mathematics, Combinatorics +5