Pages that link to "Item:Q3780763"

The following pages link to Minkowski's Convex Body Theorem and Integer Programming (Q3780763):

Displaying 50 items.

• Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
• A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)
• Alliances in graphs of bounded clique-width (Q2030439) (← links)
• On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
• Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
• On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
• On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
• Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
• Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
• LWE with side information: attacks and concrete security estimation (Q2096528) (← links)
• Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
• The integrality number of an integer program (Q2118127) (← links)
• About the complexity of two-stage stochastic IPs (Q2118129) (← links)
• A trace map attack against special ring-LWE samples (Q2128748) (← links)
• Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem (Q2128750) (← links)
• Covering convex bodies and the closest vector problem (Q2136842) (← links)
• Solving the search-LWE problem over projected lattices (Q2146741) (← links)
• An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
• On the harmless set problem parameterized by treewidth (Q2154099) (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• The Small Set Vertex expansion problem (Q2232595) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• On explaining integer vectors by few homogeneous segments (Q2256725) (← 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)
• Parameterized resiliency problems (Q2330129) (← links)
• Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
• A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• List-decoding Barnes-Wall lattices (Q2410678) (← links)
• Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
• Knapsack problems: a parameterized point of view (Q2419116) (← links)
• On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
• Recovering a sum of two squares decomposition (Q2437316) (← links)
• Fast LLL-type lattice reduction (Q2490117) (← links)
• Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
• Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
• A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
• Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
• Parameterized complexity of configuration integer programs (Q2670456) (← links)
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)