"On Obtaining Upper Bounds on the Complexity of Matrix Multiplication."

Charles M. Fiduccia (1972)

> Home

Details and statistics

DOI: 10.1007/978-1-4684-2001-2_4

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/coco/Fiduccia72
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/Fiduccia72
Charles M. Fiduccia:
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication. Complexity of Computer Computations 1972: 31-40

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.