arXiv (OAI)
open access
Lower Bounds for Subset Sum in Resolution with Modular Counting
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
- Omega bound for the Piltz divisor problem#1118893
- Inertial multiplicity bounds for two dimensional projective representations and bounds for the number of $\operatorname{PSL}_2(\mathbb{F}_q)$ and $\operatorname{PGL}_2(\mathbb{F}_q)$ number fields#997144
- Square root cancellation in the hyperbolic lattice counting problem over cocompact groups#1118902
- Sharp Diameter Bounds for Nonnegative Cyclotomic Multiples#984555
- Signed Sets with Few Subset Sums at the Offset-Two and Next Boundaries: Complete All-Size Classifications#1090119
Record · ID 158594
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