A note on the use of determinant for proving lower bounds on the size of linear circuits
From MaRDI portal
Publication:294768
DOI10.1016/S0020-0190(00)00058-2zbMath1338.68117MaRDI QIDQ294768
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000582?np=y
68Q25: Analysis of algorithms and problem complexity
15A15: Determinants, permanents, traces, other special matrix functions
Related Items
Lower bounds for matrix factorization, A super-quadratic lower bound for depth four arithmetic circuits, Shadows and intersections: Stability and new proofs, Entropy of operators or why matrix multiplication is hard for depth-two circuits, Lower bounds for matrix factorization
Cites Work