Berkowitz's Algorithm and Clow Sequences
Michael Soltys
Abstract
We present a combinatorial interpretation of Berkowitz's algorithm. Berkowitz's algorithm is the fastest known parallel algorithm for computing the characteristic polynomial of a matrix. Our combinatorial interpretation is based on ``loop covers'' introduced by Valiant, and ``clow sequences.'' Clow sequences turn out to capture very succinctly the computations performed by Berkowitz's algorithm, which otherwise is quite difficult to analyze. The main contribution of this paper is a proof of correctness of Berkowitz's algorithm in terms of clow sequences.
Create a lesson
Related papers
Directed partial orders on the complex number field
Wenyi Wang, Ruisong Yuan, Yuehui Zhang et al.
Polynomial identities, central polynomials and cocharacters of M2(F) with G-graded involution
Rafael Bezerra dos Santos, Lucas Reis
Polynomial identities, central polynomials and cocharacters of M2(F) with transpose superinvolution
Rafael Bezerra dos Santos, Lucas Reis
Range-compatible homomorphisms on Hermitian matrices
Clément de Seguins Pazzis
Transposed Triple Products and Pro-Symmetric Rings in -Rings
Huaxi Chen, Long Wang, Honglin Zou
On -Reversible and Generalized -Reversible Rings
Huaxi Chen, Long Wang, Honglin Zou