Pages that link to "Item:Q3119462"
From MaRDI portal
The following pages link to COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462):
Displaying 7 items.
- A nonapproximability result for finite function generation (Q287157) (← links)
- Complexity of generation (Q1625133) (← links)
- Algebraic dependence in generating functions and expansion complexity (Q2176295) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- Generation problems (Q2575749) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)