arXiv (All)
open access
Bounded Independence for $k$-Min-Wise Hashing: Tight Bounds and Limitations of Structured Hashing
Min-wise hashing and its $k$-min-wise extension are fundamental tools in sampling, sketching, similarity estimation, etc. A standard approach to constructing such families is bounded independence. For ordinary min-wise hashing, the required degree of independence is fully understood: $Θ(\log 1/δ)$-w
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
- Limited Independence Suffices for Large-k Min-wise Hashing#984191
- Estimating Peer Similarity using Distance of Shared Files#168213
- Close Divisors of Typical Integers:The Ford--Green--Koukoulopoulos Conjecture#1036979
- Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice#200406
- Lower Bounds for Linear Hashing via Arithmetic Kakeya#818970
Record · ID 974510
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