OpenAlex
Almost Optimal Explicit Johnson-Lindenstrauss Families
Work
Year: 2011
Type: book-chapter
Source: Lecture notes in computer science
Authors Daniel M. Kane, Raghu Meka, Jelani Nelson
Institutions Harvard University Press, The University of Texas at Austin, IIT@MIT
Cites: 22
Cited by: 42
Related to: 10
FWCI: 3.223
Citation percentile (by year/subfield): 96.1
Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green