betaFeedback

WorksMathematics

The probabilistic bound for perfect hashing is sharp only for binary alphabets

Review conversation

Reviews are not available for this work yet.

Paper details

vlnc:W_evm72ppv
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude

View statement