Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451): Difference between revisions

Revision as of 15:09, 10 July 2024

scientific article; zbMATH DE number 6472560

PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS

Language	Label	Description	Also known as
English	Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials	scientific article; zbMATH DE number 6472560	PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS

Statements

instance of

scholarly article

0 references

title

Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (English)

0 references

PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS (English)

0 references

published in

Automata, Languages, and Programming

0 references

The Journal of Symbolic Logic

0 references

publication date

7 August 2013

0 references

14 August 2015

0 references

full work available at URL

https://arxiv.org/abs/1211.0020

0 references

0 references

0 references

Ehrhart polynomials

0 references

generating functions

0 references

Presburger arithmetic

0 references

quasi-polynomials

0 references

computational complexity

0 references

cites work

The computational complexity of logical theories

0 references

A Geometric Buchberger Algorithm for Integer Programming

0 references

Short rational functions for toric algebra and applications

0 references

Q4861423

0 references

On vector partition functions

0 references

Hilbert's Tenth Problem is Unsolvable

0 references

Quasi-polynomials, linear Diophantine equations and semi-linear sets

0 references

Decompositions of Rational Convex Polytopes

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

On the base-dependence of sets of numbers recognizable by finite automata

0 references

Complexity of Presburger arithmetic with fixed quantifier dimension

0 references

Q4401029

0 references

Weak Second‐Order Arithmetic and Finite Automata

0 references

Q5704414

0 references

On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation

0 references

Counting with rational generating functions

0 references

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

0 references

COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS

0 references

Q5462454

0 references

Q4530626

0 references

The partial-fractions method for counting solutions to integral linear systems

0 references

Integer Programming with a Fixed Number of Variables

0 references

Short rational generating functions for lattice point problems

0 references

Q4790110

0 references

Subclasses of presburger arithmetic and the weak EXP hierarchy

0 references

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

0 references

Lattice point methods for combinatorial games

0 references

Dominoes and the complexity of subclasses of logical theories

0 references

Subclasses of Presburger arithmetic and the polynomial-time hierarchy

0 references

On formally undecidable propositions of \textit{Principia Mathematica} and related systems. I. With an introductory comment by Sy-David Friedman

0 references

Semigroups, Presburger formulas, and languages

0 references

The complexity of Presburger arithmetic with bounded quantifier alternation depth

0 references

Identifiers

zbMATH Open document ID

1335.03062

0 references

1353.03074

0 references

DOI

10.1007/978-3-642-39212-2_37

0 references

10.1017/jsl.2015.4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5327451

@@ Property / cites work @@
+The computational complexity of logical theories
@@ Property / cites work: The computational complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+A Geometric Buchberger Algorithm for Integer Programming
+Normal rank
@@ Property / cites work @@
+Short rational functions for toric algebra and applications
+Normal rank
@@ Property / cites work @@
+Q4861423
@@ Property / cites work: Q4861423 / rank @@
+Normal rank
@@ Property / cites work @@
+On vector partition functions
@@ Property / cites work: On vector partition functions / rank @@
+Normal rank
@@ Property / cites work @@
+Hilbert's Tenth Problem is Unsolvable
@@ Property / cites work: Hilbert's Tenth Problem is Unsolvable / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-polynomials, linear Diophantine equations and semi-linear sets
+Normal rank
@@ Property / cites work @@
+Decompositions of Rational Convex Polytopes
@@ Property / cites work: Decompositions of Rational Convex Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On the base-dependence of sets of numbers recognizable by finite automata
+Normal rank
@@ Property / cites work @@
+Complexity of Presburger arithmetic with fixed quantifier dimension
+Normal rank
@@ Property / cites work @@
+Q4401029
@@ Property / cites work: Q4401029 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+Q5704414
@@ Property / cites work: Q5704414 / rank @@
+Normal rank
@@ Property / cites work @@
+On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
+Normal rank
@@ Property / cites work @@
+Counting with rational generating functions
@@ Property / cites work: Counting with rational generating functions / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS
+Normal rank
@@ Property / cites work @@
+Q5462454
@@ Property / cites work: Q5462454 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4530626
@@ Property / cites work: Q4530626 / rank @@
+Normal rank
@@ Property / cites work @@
+The partial-fractions method for counting solutions to integral linear systems
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Short rational generating functions for lattice point problems
+Normal rank
@@ Property / cites work @@
+Q4790110
@@ Property / cites work: Q4790110 / rank @@
+Normal rank
@@ Property / cites work @@
+Subclasses of presburger arithmetic and the weak EXP hierarchy
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
+Normal rank
@@ Property / cites work @@
+Lattice point methods for combinatorial games
@@ Property / cites work: Lattice point methods for combinatorial games / rank @@
+Normal rank
@@ Property / cites work @@
+Dominoes and the complexity of subclasses of logical theories
+Normal rank
@@ Property / cites work @@
+Subclasses of Presburger arithmetic and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+On formally undecidable propositions of \textit{Principia Mathematica} and related systems. I. With an introductory comment by Sy-David Friedman
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of Presburger arithmetic with bounded quantifier alternation depth
+Normal rank