Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper)

Jose Divasón, Sebastiaan J. C. Joosten, Ondrej Kuncar, René Thiemann, Akihisa Yamada 0002. Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper). In June Andronick, Amy P. Felty, editors, Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018. pages 2-13, ACM, 2018. [doi]

@inproceedings{DivasonJKT018,
  title = {Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper)},
  author = {Jose Divasón and Sebastiaan J. C. Joosten and Ondrej Kuncar and René Thiemann and Akihisa Yamada 0002},
  year = {2018},
  doi = {10.1145/3167103},
  url = {http://doi.acm.org/10.1145/3167103},
  researchr = {https://researchr.org/publication/DivasonJKT018},
  cites = {0},
  citedby = {0},
  pages = {2-13},
  booktitle = {Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018},
  editor = {June Andronick and Amy P. Felty},
  publisher = {ACM},
  isbn = {978-1-4503-5586-5},
}