Lower bounds for matrix factorization

DOI10.1007/s00037-021-00205-2MaRDI QIDQ2041242

Mrinal Kumar, Ben lee Volk

Publication date: 16 July 2021

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.01182

zbMATH Keywords

lower bounds; algebraic complexity; matrix factorization; linear circuits

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

68Q04: Classical models of computation (Turing machines, etc.)