On the complexity of quasiconvex integer minimization problem (Q2423784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: NP-hardness of deciding convexity of quartic polynomials and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centerpoints: A Link between Optimization and Convex Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling methods for shortest vectors, closest vectors and successive minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering cubes and the closest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Shortest and Closest Lattice Vector Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of integer quasiconvex polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex functions can be approximated by quasiconvex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer optimization on convex semialgebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5785796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonlinear Mixed-Integer Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer convex minimization by mixed integer linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances between non-symmetric convex bodies and the \(MM^*\)-estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097094 / rank
 
Normal rank

Revision as of 14:38, 19 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of quasiconvex integer minimization problem
scientific article

    Statements

    On the complexity of quasiconvex integer minimization problem (English)
    0 references
    0 references
    20 June 2019
    0 references
    nonlinear integer programming
    0 references
    conic functions
    0 references
    quasiconvex functions
    0 references
    quasiconvex polynomials
    0 references
    convex functions
    0 references
    comparison oracle
    0 references
    oracle model
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers