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

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.