1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.CO2018
On the number of integer points in translated and expanded polyhedra
Danny Nguyen, Igor Pak
We prove that the problem of minimizing the number of integer points inparallel translations of a rational convex polytope in is NP-hard. We apply this result to sho…
math.LO2018
Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination
Tristram Bogart, John Goodrick, Danny Nguyen +1
We consider an expansion of Presburger arithmetic which allows multiplication by parameters . A formula in this language defines a parametric set $S_\mathbf{t}…
math.CO2017★ 1 cited
Short Presburger arithmetic is hard
Danny Nguyen, Igor Pak
We study the computational complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, ine…