arXiv (All)
open access
Approximating Partition in Deterministic Near-Linear Time
We propose a deterministic $\widetilde{O}(n + \frac{1}ε)$-time FPTAS (Fully Polynomial-Time Approximation Scheme) for the classical Partition problem. This is the best possible (up to a polylogarithmic factor) assuming SETH (Strong Exponential Time Hypothesis) [Abboud, Bringmann, Hermelin, and Shabt
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
- The range and omitted values of a certain sequence involving the partition function#986452
- Measuring the spatio-temporal variation of fundamental physical constants using the OH sum rules#1083451
- Some uniform estimates for Kähler--Ricci Shrinkers#818828
- Some uniform estimates for Kähler--Ricci Shrinkers#808836
- Optimal Purity Estimation with Incoherent Measurements#1154510
Record · ID 1062757
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