Pages that link to "Item:Q3780763"
From MaRDI portal
The following pages link to Minkowski's Convex Body Theorem and Integer Programming (Q3780763):
Displaying 50 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Improvements in closest point search based on dual HKZ-bases (Q391764) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Cryptanalysis of the GGH cryptosystem (Q626951) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Parameterized complexity of locally minimal defensive alliances (Q831707) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Optimal routing in double loop networks (Q995561) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Dual vectors and lower bounds for the nearest lattice point problem (Q1107568) (← links)
- Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- Lattice translates of a polytope and the Frobenius problem (Q1196686) (← links)
- Complexity of the closest vector problem in a lattice generated by a (0,1)-matrix (Q1198041) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Finding a shortest vector in a two-dimensional lattice modulo m (Q1392031) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- Analysis of hidden number problem with hidden multiplier (Q1691252) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- Multi-attribute proportional representation (Q1731837) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- Parallel machine scheduling with speed-up resources (Q1754306) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
