Quantifier elimination over the integers
From MaRDI portal
Cites work
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- An efficient quantifier elimination procedure for Presburger arithmetic
- Computing the integer points of a polyhedron. I: Algorithm
- Computing the integer points of a polyhedron. II: Complexity estimates
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Counting the integer points of parametric polytopes: a Maple implementation
- Effective lattice point counting in rational convex polytopes
- Efficient detection of redundancies in systems of linear inequalities
- Fourier-Motzkin elimination extension to integer programming problems
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- Integer programming as projection
- Local Search for SMT on Linear Integer Arithmetic
- New Bounds for the Vertices of the Integer Hull
- On Fourier's algorithm for linear arithmetic constraints
- On the combinatorial and algebraic complexity of quantifier elimination
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Parametric integer programming
- Parametric integer programming in fixed dimension
- Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior
- The complexity of quantifier elimination and cylindrical algebraic decomposition
This page was built for publication: Quantifier elimination over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288999)
