Fast rectangular matrix multiplication and some applications (Q931517): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11425-007-0169-2 / 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.1007/s11425-007-0169-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137152740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast rectangular matrix multiplication and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The aggregation and cancellation techniques as a practical tool for faster matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Can We Speed Up Matrix Multiplication? / 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: Rectangular matrix multiplication revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Total Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic-time factoring of polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Frobenius maps and factoring polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel evaluation of the determinant and of the inverse of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using fast matrix multiplication to find basic solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid Multiplication of Rectangular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials over finite fields: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of polynomials and some linear-algebra problems over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a New Factorization Algorithm for Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomial factorization over finite fields / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11425-007-0169-2 / rank
 
Normal rank

Latest revision as of 08:34, 10 December 2024

scientific article
Language Label Description Also known as
English
Fast rectangular matrix multiplication and some applications
scientific article

    Statements

    Fast rectangular matrix multiplication and some applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2008
    0 references
    rectangular matrix multiplication
    0 references
    asymptotic arithmetic complexity
    0 references
    bilinear algorithm
    0 references
    polynomial factorization over finite fields
    0 references

    Identifiers