Complexity of short Presburger arithmetic
arXiv:1704.00249
Abstract
We study complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of the integers involved in the inequalities. We prove that assuming Kannan's partition can be found in polynomial time, the satisfiability of Short-PA sentences can be decided in polynomial time. Furthermore, under the same assumption, we show that the numbers of satisfying assignments of short Presburger sentences can also be computed in polynomial time.
References in corpus (7)
- A primal Barvinok algorithm based on irrational decompositions
- Counting with rational generating functions
- Presburger arithmetic, rational generating functions, and quasi-polynomials
- On the complexity of computing Kronecker coefficients
- A Quantitative Doignon-Bell-Scarf Theorem
- Enumerating projections of integer points in unbounded polyhedra
- Complexity of short generating functions