Complexity of monotone networks for Boolean matrix product

Paterson, M.S. (1974) Complexity of monotone networks for Boolean matrix product. Technical Report. Department of Computer Science, Coventry, UK.

[img]
Preview
 PDF
Download (498Kb) | Preview

    Abstract

    Any computation of Boolean matrix product by an acyclic network
    using only the operations of binary conjunction and disjunction
    requires at least $IJK$ conjunctions and $IJ(K-1)$ disjunctions for the
    product of matrices of sizes $I \times K$ and $K\times J$. Furthermore any two
    such networks having these minimum numbers of operations are equivalent
    using only the commutativity of both operations and the associativity
    of disjunction.

    Item Type: Monograph (Technical Report)
    Additional Information: M.S.&nbsp;Paterson, &ldquo;Complexity of Monotone Networks for Boolean Matrix Product&rdquo;, <i>Theoretical Computer Science</i> <b>1</b>(1), pp.&nbsp;13-20 (1975)
    Uncontrolled Keywords: technicalreport
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Divisions: Faculty of Science > Computer Science
    Depositing User: Mr Ebrahim Ardeshir
    Date Deposited: 01 May 2012 09:58
    Last Modified: 01 Nov 2012 18:07
    URI: http://eprints.dcs.warwick.ac.uk/id/eprint/1125

    Actions (login required)

    		 View Item