arXiv (All)
open access
Curvature batching for integer and mixed-integer quadratic programming
We give an explicit algorithm for integer quadratic programming with running time $(nL)^{O(n^2)} \mathrm{poly}(ϕ)$, where $n$ is the number of variables, $L$ bounds the absolute entries of the constraint and quadratic matrices, and $ϕ$ is the total input encoding length. The linear objective and con
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
- BGP Support for Four-octet AS Number Space#500877
- Transcriptomic Characterization of Regulatory Programs in Lipid-Processing Microglia in Alzheimer's Disease#207035
- Operator Norm Bounds for Multi-leg Matrix Tensors and Applications to Random Matrix Theory#1156312
- STELLA: A 16nm Spatio-Temporal Elastic Low-Latency CGRA for Multi-Stage Pipelined Applications#1144670
- Learning to Optimize by Differentiable Programming#798738
Record · ID 1011069
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