Pages that link to "Item:Q2894466"
From MaRDI portal
The following pages link to A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming (Q2894466):
Displaying 8 items.
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- (Q5092485) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)