Complexity of monotone networks for Boolean matrix product
type: Item
instance of: scholarly article
title: Complexity of monotone networks for Boolean matrix product
zbMATH Open document ID: 0307.68031
DOI: 10.1016/0304-3975(75)90009-2
author: Michael S. Paterson
published in: Theoretical Computer Science
publication date: 1975-01-01T00:00:00Z
full work available at URL: WRAP Paterson cs-rr-002.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 3481835
MaRDI profile type: Publication
OpenAlex ID: W2569195351
cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
cites work: Q4128424
description: scientific article; zbMATH DE number 3481835