Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.

zbMATH Open0885.68066MaRDI QIDQ1380697FDOQ1380697

Peter Bürgisser

Publication date: 12 March 1998

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119289

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 727424
• Matrix multiplication via arithmetic progressions
• Fast matrix multiplication and its algebraic neighbourhood
• Fast rectangular matrix multiplication and applications

zbMATH Keywords

algebraic complexity theorycomputational linear algebra

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (8)

• Title not available (Why is that?)
• Some computational problems in linear algebra as hard as matrix multiplication
• Matrix multiplication via arithmetic progressions
• The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
• Title not available (Why is that?)
• On the complexity of matrix reduction over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380697)