A sparse Johnson-Lindenstrauss transform using fast hashing

DOI10.4230/LIPICS.ICALP.2023.76MaRDI QIDQ6638079zbMATH OpenFDO

Authors Jakob Bæk Tejs Houen, Mikkel Thorup

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.76

zbMATH Keywords

concentration boundsdimensionality reductionhashingmoment bounds

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

• Derandomization with pseudorandomness

This page was built for publication: A sparse Johnson-Lindenstrauss transform using fast hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638079)