Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation

preprint2020arXivOpen access

We study the problem of determining the Boolean product of two n\times n Boolean matrices in an unconventional computational model allowing for mechanical operations. We show that O(n^2) operations are sufficient to compute the product in this model.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0