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

04/27/2020

∙

by   Andrzej Lingas, et al.

∙

0

∙

share

We study the problem of determining the Boolean product of two n× 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.