Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On The Complexity Of Symmetric Computations*

From MaRDI portal
Publication:4403719
Jump to:navigation, search

DOI10.1080/03155986.1974.11731565zbMATH Open0277.68022OpenAlexW2405822424MaRDI QIDQ4403719FDOQ4403719


Authors: Robert L. Probert Edit this on Wikidata


Publication date: 1974

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1974.11731565





Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)



Cited In (3)

  • Fast matrix multiplication and its algebraic neighbourhood
  • Computational methods of linear algebra
  • Commutativity, non-commutativity, and bilinearity





This page was built for publication: On The Complexity Of Symmetric Computations*

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4403719&oldid=18425609"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 01:53. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki