Complexity of the pipeline computation of a family of inner products

DOI10.1016/0165-4896(85)90009-5zbMath0564.68034OpenAlexW2047485931MaRDI QIDQ1058291

Maurice Tchuente

Publication date: 1985

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(85)90009-5

zbMATH Keywords

polynomial time algorithmNP-completeinner productssystolic arraypartition problempipeline computationundirected bipartite eulerian multigraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of the pipeline computation of a family of inner products