Most Tensor Problems Are NP-Hard.
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries.
Tensor-Rank and Lower Bounds for Arithmetic Formulas.
Persistence-Based Clustering in Riemannian Manifolds.
On Ideal Lattices and Learning with Errors over Rings.
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking.