Lower bounds on the bounded coefficient complexity of bilinear maps
From MaRDI portal
Publication:3583577
DOI10.1145/990308.990311zbMath1192.68312arXivcs/0301016OpenAlexW1979175600MaRDI QIDQ3583577
Publication date: 17 August 2010
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0301016
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Binary determinantal complexity ⋮ A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle ⋮ Matrix rigidity of random Toeplitz matrices ⋮ Faster Polynomial Multiplication via Discrete Fourier Transforms ⋮ Entropy of operators or why matrix multiplication is hard for depth-two circuits
This page was built for publication: Lower bounds on the bounded coefficient complexity of bilinear maps
