arXiv (All)
open access
Bounded Cubic Integer Programming in Fixed Dimension
We consider the exact minimization of a rational cubic polynomial over the integer points of a rational polytope in fixed dimension. Del Pia, Hildebrand, Weismantel, and Zemmer proved polynomial-time solvability in dimension two, while quartic polynomial minimization is already NP-hard in dimension
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A geometric characterization of unbounded integer cubic optimization problems via thin rays#1050782
- On the integrality gap of convex mixed-integer programs#149208
- Value Functions of Separable Convex Integer Programs are Periodically Convex#1061739
- Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$#31204
- Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms#972144
Record · ID 1012462
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive