Pages that link to "Item:Q5494988"

The following pages link to Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings (Q5494988):

Displaying 39 items.

• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
• The isotropic position and the reverse Santaló inequality (Q476488) (← links)
• A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
• FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
• Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
• On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
• Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
• Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
• The integrality number of an integer program (Q2118127) (← links)
• Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
• Covering convex bodies and the closest vector problem (Q2136842) (← links)
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
• On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
• A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
• Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
• Voronoi Cells of Lattices with Respect to Arbitrary Norms (Q3174772) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• The Integrality Number of an Integer Program (Q5041756) (← links)
• Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
• Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) (← links)
• (Q5111743) (← links)
• Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
• Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
• Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
• On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)