Beyond the Alder-Strassen bound. (Q1770421): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038253106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of associative algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the multiplicative complexity of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the bilinear complexity of associative algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of bivariate power series arithmetic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal evaluation of a set of bilinear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4300259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the complexity of bilinear problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Total Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and optimal computation of generic tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative bilinear complexity and matrix multiplication. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:16, 7 June 2024

scientific article
Language Label Description Also known as
English
Beyond the Alder-Strassen bound.
scientific article

    Statements

    Beyond the Alder-Strassen bound. (English)
    0 references
    0 references
    6 April 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    associative algebras
    0 references
    lower bounds
    0 references
    multiplicative complexity
    0 references
    0 references