Approximating sparse binary matrices in the cut-norm

DOI10.1016/j.laa.2015.08.024zbMath1327.15044OpenAlexW1786358965MaRDI QIDQ498332

Noga Alon

Publication date: 28 September 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.08.024

zbMATH Keywords

low rank approximationcutnorm

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Related Items (2)

Ultimate data hiding in quantum mechanics and beyond ⋮ An ensemble of high rank matrices arising from tournaments

Cites Work

• Unnamed Item
• Quick approximation to matrices and applications
• Equilateral sets in \(l_p^n\)
• Random sampling and approximation of MAX-CSPs
• The Hadamard Operator Norm of a Circulant and Applications
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• On the best constants in the Khinchin inequality
• The approximate rank of a matrix and its algorithmic applications

This page was built for publication: Approximating sparse binary matrices in the cut-norm