Parametric Presburger arithmetic: complexity of counting and quantifier elimination (Q5108860)

scientific article; zbMATH DE number 7197321

Language	Label	Description	Also known as
English	Parametric Presburger arithmetic: complexity of counting and quantifier elimination	scientific article; zbMATH DE number 7197321

Statements

instance of

scholarly article

0 references

title

Parametric Presburger arithmetic: complexity of counting and quantifier elimination (English)

0 references

published in

Mathematical Logic Quarterly

0 references

publication date

6 May 2020

0 references

full work available at URL

https://arxiv.org/abs/1802.00974

0 references

http://hdl.handle.net/2027.42/151911

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed

0 references

Short rational generating functions for lattice point problems

0 references

Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior

0 references

Hilbert's Tenth Problem is Unsolvable

0 references

Q4082296

0 references

A wild model of linear arithmetic and discretely ordered modules

0 references

Subclasses of Presburger arithmetic and the polynomial-time hierarchy

0 references

Geometry of continued fractions

0 references

A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic

0 references

Q3818127

0 references

Quantifier elimination for modules with scalar variables

0 references

The unreasonable ubiquitousness of quasi-polynomials

0 references

Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials

0 references

Identifiers

DOI

10.1002/malq.201800068

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5108860