arXiv (All)
open access
A simplified proof of polynomial improvements for 3SUM and APSP
We give a simplified proof of the polynomial improvements for integer 3SUM and all-pairs shortest paths (APSP) established by Alman and Vassilevska Williams, with weaker exponents. The central ingredient is selected-entry matrix multiplication: computing a prescribed set of entries of a product of d
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
- Real-rootedness of Kazhdan--Lusztig polynomials of sparse paving matroids#1216474
- An optimal constant for vector balancing with permutations#1157475
- Approximate Polynomial Satisfiability is in the Counting Hierarchy#1155579
- Circular Rearrangement Inequality and Optimal Cyclic Birth and Death Chains#999460
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
Record · ID 1326913
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