Pages that link to "Item:Q5503570"
From MaRDI portal
The following pages link to Linear and Integer Programming vs Linear Integration and Counting (Q5503570):
Displaying 6 items.
- \(L^{p}\)-norms, log-barriers and Cramer transform in optimization (Q618872) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
