Presburger arithmetic with threshold counting quantifiers is easy
D Chistikov, C Haase, A Mansutti - arXiv preprint arXiv:2103.05087, 2021 - arxiv.org
We give a quantifier elimination procedures for the extension of Presburger arithmetic with a
unary threshold counting quantifier $\exists^{\ge c} y $ that determines whether the number …
unary threshold counting quantifier $\exists^{\ge c} y $ that determines whether the number …
A Plethora of Polynomials: A Toolbox for Counting Problems
A wide variety of problems in combinatorics and discrete optimization depend on counting
the set S of integer points in a polytope, or in some more general object constructed via …
the set S of integer points in a polytope, or in some more general object constructed via …
What is an answer?-remarks, results and problems on PIO formulas in combinatorial enumeration, part I
M Klazar - arXiv preprint arXiv:1808.08449, 2018 - arxiv.org
For enumerative problems, ie computable functions f from N to Z, we define the notion of an
effective (or closed) formula. It is an algorithm computing f (n) in the number of steps that is …
effective (or closed) formula. It is an algorithm computing f (n) in the number of steps that is …
[图书][B] The Computational Complexity of Presburger Arithmetic
DN Luu - 2018 - search.proquest.com
A wide variety of problems in Discrete Optimization and Integer Programming can be
naturally phrased in the language of Presburger Arithmetic (PA), which is the first order logic …
naturally phrased in the language of Presburger Arithmetic (PA), which is the first order logic …
The Computational Complexity of Presburger Arithmetic
D Nguyen Luu - 2018 - escholarship.org
A wide variety of problems in Discrete Optimization and Integer Programming can be
naturally phrased in the language of Presburger Arithmetic (PA), which is the first order logic …
naturally phrased in the language of Presburger Arithmetic (PA), which is the first order logic …