The following pages link to (Q3745276):
Displaying 50 items.
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- On finite-precision representations of geometric objects (Q584309) (← links)
- Rational orthogonal approximations to orthogonal matrices (Q676580) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) (← links)
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Jug measuring: algorithms and complexity (Q924133) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- A geometric inequality and the complexity of computing volume (Q1087143) (← links)
- Computing the volume is difficult (Q1093369) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- The maximum clique problem (Q1318271) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Super-Golden-Gates for \(PU(2)\) (Q1701020) (← links)
- The Santalo point of a planar convex set (Q1802415) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Bicliques and eigenvalues (Q1850533) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
- On the number of lattice free polytopes (Q1964651) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Comment on: ``Approximation algorithms for quadratic programming'' (Q2165269) (← links)
- The Collatz-Wielandt quotient for pairs of nonnegative operators. (Q2216221) (← links)
- On sparse reflexive generalized inverse (Q2294248) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- Blocking duality for \(p\)-modulus on networks and applications (Q2420264) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
