On identity testing of tensors, low-rank recovery and compressed sensing
From MaRDI portal
Publication:5415473
DOI10.1145/2213977.2213995zbMath1286.68489arXiv1111.0663OpenAlexW3103519306MaRDI QIDQ5415473
Amir Shpilka, Michael A. Forbes
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0663
Fault detection; testing in circuits and networks (94C12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20)
Related Items (15)
Higgledy-piggledy subspaces and uniform subspace designs ⋮ Deterministic Truncation of Linear Matroids ⋮ Subexponential size hitting sets for bounded depth multilinear formulas ⋮ Explicit subspace designs ⋮ Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Read-once polynomial identity testing ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ Lower bounds for matrix factorization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lower bounds for matrix factorization ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits ⋮ Rank-Metric Codes and Their Applications
This page was built for publication: On identity testing of tensors, low-rank recovery and compressed sensing
