Certifying Exact Complexity Bounds for Matrix Interpretations

Abstract

CeTA is a tool — whose correctness is formally proven in Isabelle/HOL —
that certifies complexity proofs generated by untrusted complexity analyzers.
We present our recent developments in CeTA that enables certifying exact
complexity bounds for matrix interpretations. We formalized a number of
important results in linear algebra, as well as an implementation of
algebraic numbers.