Browse by Person (creator, editor, contributor, etc.)

Up a level

Export as ASCII CitationBibTeXDublin CoreEP3 XMLEndNoteHTML CitationJSONMETSMultiline CSVMultiline CSV (Staff)Object IDsOpenURL ContextObjectRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager	Atom RSS 1.0 RSS 2.0

Group by: Item Type | Date | No Grouping

Jump to: Conference or workshop item

Number of items: 1.

Conference or workshop item

Férée, Hugo and Hym, Samuel and Mayero, Micaela and Moyen, Jean-Yves and Nowak, David (2018) Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations. In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. ACM ISBN 978-1-4503-5586-5. (doi:https://doi.org/10.1145/3167097) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

This list was generated on Thu Apr 11 22:39:50 2019 BST.