arXiv (All)
open access
Lower Bounds for Linear Hashing via Arithmetic Kakeya
Affine modular linear hashing is one of the simplest classical hash families. For a prime $p > u$, the hash function is obtained by choosing $s,t$ uniformly from $\mathbb{Z}_p$ and mapping each key $x \in \{0,\ldots,u-1\}$ to one of $n$ bins by $h(x) = [(sx+t) \bmod p] \bmod n$. Despite its simplici
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
- Lower Bounds for Linear Hashing via Arithmetic Kakeya#808978
- Why is it best to use a prime number as a mod in a hashing function?#796534
- Divisor function and bounds in domains with enough primes#955637
- Efficient Mod Approximation and Its Applications to CKKS Ciphertexts#665618
- Efficient Mod Approximation and Its Applications to CKKS Ciphertexts#664118
Record · ID 818970
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