Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
109
Voted
MFCS
2007
Springer
88
views
Theoretical Computer Science
»
more
MFCS 2007
»
Semisimple Algebras of Almost Minimal Rank over the Reals
15 years 9 months ago
Download
www-cc.cs.uni-saarland.de
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
Markus Bläser, Andreas Meyer de Voltaire
claim paper
Read More »