Skip to Main Content (Press Enter)

Logo UNIMORE
  • ×
  • Home
  • Degree programmes
  • Modules
  • Jobs
  • People
  • Research Outputs
  • Academic units
  • Third Mission
  • Projects
  • Skills

UNI-FIND
Logo UNIMORE

|

UNI-FIND

unimore.it
  • ×
  • Home
  • Degree programmes
  • Modules
  • Jobs
  • People
  • Research Outputs
  • Academic units
  • Third Mission
  • Projects
  • Skills
  1. Research Outputs

Parallel Complexity of Matrix Computations

Chapter
Publication Date:
1991
Short description:
Parallel Complexity of Matrix Computations / B., C., Leoncini, M., G., R. - In: Complexity of Structured Computational Problems / R. BEVILACQUA; D. BINI; M. CAPOVANI; G. CAPRIZ; B. CODENOTTI; M. LEONCINI; G. RESTA; P. ZELLINI. - STAMPA. - PISA : Giardini, 1991. - pp. 73-130
Iris type:
Capitolo/Saggio
Keywords:
Computational complexity; parallel computing; matrix algorithms
List of contributors:
B., Codenotti; Leoncini, Mauro; G., Resta
Authors of the University:
LEONCINI Mauro
Handle:
https://iris.unimore.it/handle/11380/461941
Book title:
Complexity of Structured Computational Problems
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.8.0.3