Pages that link to "Item:Q4978025"
From MaRDI portal
The following pages link to Complexity of short Presburger arithmetic (Q4978025):
Displaying 6 items.
- Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
