On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Joseph M. Landsberg / rank
Normal rank
 
Property / author
 
Property / author: Joseph M. Landsberg / rank
 
Normal rank
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.1080/10586458.2016.1162230 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964247956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices / 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: On the third secant variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the border rank of a bilinear map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations for Lower Bounds on Border Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: The border rank of the multiplication of $2\times 2$ matrices is seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the border rank of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on border rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Total Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bilinear complexity and practical algorithms for matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices / 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: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:11, 14 July 2024

scientific article; zbMATH DE number 6754277
Language Label Description Also known as
English
On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication
scientific article; zbMATH DE number 6754277

    Statements

    On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (English)
    0 references
    0 references
    0 references
    27 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    border rank
    0 references
    matrix multiplication
    0 references
    Segre variety
    0 references
    0 references