Most Tensor Problems Are NP-Hard
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
Random graphs and the parity quantifier