arXiv (All)
open access
An ETH-Tight, Constructive FPT Algorithm for the Cone and Polytope Intersection Problem
In a landmark paper, Goemans and Rothvoss (2020) established an XP algorithm running in time $\text{enc}(P)^{2^{O(d)}} \cdot \text{enc}(Q)^{O(1)}$ for the \emph{Cone and Polytope Intersection} problem: finding a vector $y \in \text{int.cone}(P \cap \mathbb{Z}^d) \cap Q$ together with a sparse certif
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 Note on Sphere Packing Bounds for Tuple Lattice Sieving#667908
- Fixed-Perimeter Franklin Statistics and an Eventual Inequality#999985
- Inverse Theorems for Point-Sphere Incidences over Finite Fields#820356
- Monotone Diameters of Lattice Polytopes#985981
- Improved bounds for universal convex covers of unit arcs#1036356
Record · ID 1106027
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