The complexity of Boolean matrix root computation

Martin Kutz. The complexity of Boolean matrix root computation. Theoretical Computer Science, 325(3):373-390, 2004. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: