Recursive n-gram hashing is pairwise independent, at best
Year: 2012
Type: preprint
Authors: Daniel Lemire A, Owen Kaser B
Institutions: Université du Québec à Montréal, University of New Brunswick
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W3123160398