Treffer: A Complete Characterization of the Algebras of Minimal Bilinear Complexity: A complete characterization of the algebras of minimal bilinear complexity

Title:
A Complete Characterization of the Algebras of Minimal Bilinear Complexity: A complete characterization of the algebras of minimal bilinear complexity
Authors:
Markus Bläser
Source:
SIAM Journal on Computing. 34:277-298
Publisher Information:
Society for Industrial & Applied Mathematics (SIAM), 2005.
Publication Year:
2005
Subject Terms:
rank, bilinear complexity, 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), associative algebras, 0102 computer and information sciences, 02 engineering and technology, Symbolic computation and algebraic computation, Computational aspects of associative rings (general theory), Alder-Strassen bound, 01 natural sciences
Document Type:
Fachzeitschrift Article
File Description:
application/xml
Language:
English
ISSN:
1095-7111
0097-5397
DOI:
10.1137/s0097539703438277
Access URL:
https://dl.acm.org/doi/10.1137/S0097539703438277
https://epubs.siam.org/doi/abs/10.1137/S0097539703438277
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp34.html#Blaser04
Accession Number:
edsair.doi.dedup.....7b98a7e740f08a6c39c01c5d8c72bb39
Database:
OpenAIRE

Weitere Informationen

zbMATH Open Web Interface contents unavailable due to conflicting licenses.