Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation
Data Structures and Algorithms
2020-05-25 v2
Abstract
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.
Cite
@article{arxiv.2004.13086,
title = {Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation},
author = {Andrzej Lingas and Mia Persson},
journal= {arXiv preprint arXiv:2004.13086},
year = {2020}
}
Comments
11 pages, 7 figures