most citedOptimal Hardness of Online Algorithms for Large Independent Sets

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.STShow all

1 paper · 1 filter

math.ST2025

Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements

Eren C. Kızıldağ

In this paper, we investigate the sample complexity of recovering tensors with low symmetric rank from symmetric rank-one measurements. This setting is particularly motivated by th…