Pages that link to "Item:Q5327451"
From MaRDI portal
The following pages link to Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451):
Displaying 17 items.
- The unreasonable ubiquitousness of quasi-polynomials (Q405135) (← links)
- Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
- Counting essential surfaces in \(3\)-manifolds (Q2131230) (← links)
- Epsilon multiplicity for Noetherian graded algebras (Q2152775) (← links)
- The parametric Frobenius problem (Q2346475) (← links)
- COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
- Parametrizing an Integer Linear Program by an Integer (Q3130449) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- Length of local cohomology of powers of ideals (Q4645124) (← links)
- Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs (Q5051472) (← links)
- A Plethora of Polynomials: A Toolbox for Counting Problems (Q5067476) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
- Parametric Presburger arithmetic: complexity of counting and quantifier elimination (Q5108860) (← links)
- Target counting with Presburger constraints and its application in sensor networks (Q5160798) (← links)
- (Q5501764) (redirect page) (← links)
- Finitely generated saturated multi-Rees algebras (Q6196148) (← links)
