Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Complexity of monotone networks for Boolean matrix product

Tools
- Tools
+ Tools

Paterson, Michael S. (1974) Complexity of monotone networks for Boolean matrix product. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

[img]
Preview
Text
WRAP_Paterson_cs-rr-002.pdf - Published Version

Download (688Kb) | Preview

Request Changes to record.

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 x K and K x 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: Report
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Matrices
Series Name: Theory of Computation Report
Publisher: University of Warwick. Department of Computer Science
Official Date: July 1974
Dates:
DateEvent
July 1974["eprint_fieldopt_dates_date_type_available" not defined]
Number: Number 2
Number of Pages: 14
DOI: CS-RR-002
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Reuse Statement (publisher, data, author rights): 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)
Access rights to Published version: Open Access (Creative Commons)
Date of first compliant deposit: 1 August 2016
Date of first compliant Open Access: 1 August 2016
Version or Related Resource: Paterson, M.S. (1975). Complexity of monotone networks for Boolean matrix product. Theoretical computer science, 1(1), pp.13-20.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us