"Efficient certification of complexity proofs: formalizing the ..."

Jose Divasón et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3167103

access: closed

type: Conference or Workshop Paper

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpp/DivasonJKT018
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpp/DivasonJKT018
Jose Divasón, Sebastiaan J. C. Joosten, Ondrej Kuncar, René Thiemann, Akihisa Yamada:
Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper). CPP 2018: 2-13

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.