"Formal proof of polynomial-time complexity with quasi-interpretations."

Hugo Férée et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3167097

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpp/FereeHMMN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpp/FereeHMMN18
Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak:
Formal proof of polynomial-time complexity with quasi-interpretations. CPP 2018: 146-157

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.