Optimal succinct rank data structure via approximate nonnegative tensor decomposition

DOI10.1145/3313276.3316352zbMath1433.68108arXiv1811.02078OpenAlexW2963524628MaRDI QIDQ5212836

Huacheng Yu

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.02078

zbMATH Keywords

partial sumtensor decompositionsuccinct data structurespillover representation

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Data structures (68P05)

Related Items

Nearly Optimal Static Las Vegas Succinct Dictionary, Unnamed Item