On linear hashing of binary sets (Q1280345)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On linear hashing of binary sets |
scientific article; zbMATH DE number 1261636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On linear hashing of binary sets |
scientific article; zbMATH DE number 1261636 |
Statements
On linear hashing of binary sets (English)
0 references
15 March 1999
0 references
The main result of the paper is as follows. For any \(k\) let the inequality \[ 2^{k+1} - k - 2> \tfrac 12 m(m-1) \] be satisfied, where \(m=O(n^p)\) has polynomial growth. Then there exists a linear hashing operator \(\mathcal H\) with the scheme realization complexity \[ l(\mathcal H)\lesssim 2p(n-2p\log n)\log n, \] which can be efficiently constructed.
0 references
linear hashing operator
0 references
0.7679415941238403
0 references
