Computing the boolean product of two n × n boolean matrices using o(N2) mechanical operations
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(n2 ) operations are sufficient to compute the product in this model.
