arXiv (All)
open access
Practical Deterministic Linear-Time Modular Subset Sum
We give a deterministic algorithm for exact modular subset sum that, for every modulus m, computes all reachable residues and one requested witness in O(m) time and O(m) auxiliary words. The input is a compact list of distinct residues with multiplicities, and the word-RAM supports constant-time mod
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
- On Some Generalisations of Gauss Sequences#1061649
- Residue Number System Comparison revisited, a software perspective#200448
- Efficient Mod Approximation and Its Applications to CKKS Ciphertexts#665618
- Efficient Mod Approximation and Its Applications to CKKS Ciphertexts#664118
- A CRT Framework for Montgomery-Type Modular Reduction#1143561
Record · ID 1105551
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