Efficient Certification of Complexity Proofs: Formalizing the Perron–Frobenius Theorem (Invited Talk Paper)

doi 10.1145/3167103
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press


Related search