Approximate Solutions for the Bilinear Form Computational Problem

From MaRDI portal
Revision as of 19:46, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3891766

DOI10.1137/0209053zbMath0446.68035OpenAlexW2019603005WikidataQ60307015 ScholiaQ60307015MaRDI QIDQ3891766

Dario Andrea Bini, Francesco Romani, Grazia Lotti

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209053




Related Items (29)

A note on VNP-completeness and border complexityBorder rank of m\(\times n\times (mn-q)\) tensorsTensors in computationsMinimum entangling power is close to its maximumUnnamed ItemMatrix structures in parallel matrix computationsAlgebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer scienceBad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativityNumerical stability and tensor nuclear normNew lower bounds for matrix multiplication andTensor rank is not multiplicative under the tensor productComplexity measures for matrix multiplication algorithmsRelations between exact and approximate bilinear algorithms. ApplicationsTensor decompositions and rank increment conjectureUnnamed ItemFast matrix multiplication and its algebraic neighbourhoodReply to the paper The numerical instability of Bini's algorithmOn the asymptotic complexity of rectangular matrix multiplicationEntanglement distillation from Greenberger-Horne-Zeilinger sharesAsymptotic entanglement transformation between W and GHZ statesError analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systemsNumerical tensor calculusThe border rank of the multiplication of $2\times 2$ matrices is sevenOn best rank-2 and rank-(2,2,2) approximations of order-3 tensorsFast arithmetic for triangular sets: from theory to practiceRank and border rank of Kronecker powers of tensors and Strassen's laser method$$P\mathop{ =}\limits^{?}NP$$On commutativity and approximationMinimal divergence for border rank-2 tensor approximation







This page was built for publication: Approximate Solutions for the Bilinear Form Computational Problem