On commutativity and approximation
DOI10.1016/0304-3975(83)90068-3zbMATH Open0548.68036OpenAlexW2021882883MaRDI QIDQ799369FDOQ799369
Authors: Dario A. Bini 
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90068-3
Recommendations
- A note on border rank
- On the approximate bilinear complexity of matrix multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- Optimal evaluation of pairs of bilinear forms
matrix multiplicationtensor rankalgebraic complexityapproximate algorithmpolynomial evaluationmatrix-vector productapproximate complexitycommutative border rank
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Cites Work
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Partial and Total Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- Polynomials with Rational Coefficients Which are Hard to Compute
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- On the number of multiplications necessary to compute certain functions
- Title not available (Why is that?)
- Approximate Solutions for the Bilinear Form Computational Problem
- Some elementary proofs of lower bounds in complexity theory
- Title not available (Why is that?)
- On the Complexity of Bilinear Forms with Commutativity
Cited In (7)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
- Notes on commutation of limits and colimits
- Computational Complexity of Inner Products of Vectors (And That of Other Bilinear Forms) over a Noncommutative Ring (Auxiliary Functions Allowed)
- On the commutativity of jumps
- Matrix structures in parallel matrix computations
- Lower bound for the approximative complexity
- On the Small Squaring and Commutativity
This page was built for publication: On commutativity and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799369)
