Abstract
A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Moscow University Computational Mathematics and Cybernetics
Paper Title
Journal
Date
