{"id":"https://openalex.org/W2778694581","doi":"https://doi.org/10.1145/3167097","title":"Formal proof of polynomial-time complexity with quasi-interpretations","display_name":"Formal proof of polynomial-time complexity with quasi-interpretations","publication_year":2018,"publication_date":"2018-01-08","ids":{"openalex":"https://openalex.org/W2778694581","doi":"https://doi.org/10.1145/3167097","mag":"2778694581"},"language":"en","primary_location":{"id":"doi:10.1145/3167097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3167097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044427763","display_name":"Hugo F\u00e9r\u00e9e","orcid":"https://orcid.org/0000-0003-3103-5612"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hugo F\u00e9r\u00e9e","raw_affiliation_strings":["University of Kent, UK","University of Kent [Canterbury] (Canterbury,\r\nKent,\r\nCT2 7NZ - United Kingdom)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kent, UK","institution_ids":["https://openalex.org/I20581793"]},{"raw_affiliation_string":"University of Kent [Canterbury] (Canterbury,\r\nKent,\r\nCT2 7NZ - United Kingdom)","institution_ids":["https://openalex.org/I20581793"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051234674","display_name":"Samuel Hym","orcid":null},"institutions":[{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Samuel Hym","raw_affiliation_strings":["University of Lille, France","2XS - Extra Small Extra Safe (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lille, France","institution_ids":["https://openalex.org/I2279609970"]},{"raw_affiliation_string":"2XS - Extra Small Extra Safe (France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060373188","display_name":"Micaela Mayero","orcid":null},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Micaela Mayero","raw_affiliation_strings":["University of Paris 13, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paris 13, France","institution_ids":["https://openalex.org/I4210091279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054567629","display_name":"Jean-Yves Moyen","orcid":"https://orcid.org/0000-0002-6883-6993"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jean-Yves Moyen","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041702710","display_name":"David Nowak","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"David Nowak","raw_affiliation_strings":["CNRS, France / University of Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, France / University of Lille, France","institution_ids":["https://openalex.org/I2279609970","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.169,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57200541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"146","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5320730209350586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523673951625824},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4739173352718353},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4722263813018799},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.46541666984558105},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.4484727382659912},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3792724311351776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3661443293094635},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.32720836997032166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25918513536453247},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.14323309063911438},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.059503406286239624}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5320730209350586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523673951625824},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4739173352718353},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4722263813018799},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.46541666984558105},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.4484727382659912},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3792724311351776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3661443293094635},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.32720836997032166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25918513536453247},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.14323309063911438},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.059503406286239624},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3167097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3167097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:kar.kent.ac.uk:66330","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3167097>)","pdf_url":null,"source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:HAL:hal-01712390v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01712390","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Jan 2018, Los Angeles, United States. ⟨10.1145/3167097⟩","raw_type":"Conference papers"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/9f193ec7-74a0-4a6f-a40d-9593adab8059","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/9f193ec7-74a0-4a6f-a40d-9593adab8059","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"F\u00e9r\u00e9e , H , Hym , S , Mayero , M , Moyen , J Y & Nowak , D 2018 , Formal proof of polynomial-time complexity with quasi-interpretations . in CPP 2018 - Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with POPL 2018 . Association for Computing Machinery , pp. 146-157 , 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018 , Los Angeles , United States , 08/01/2018 . https://doi.org/10.1145/3167097","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W131531808","https://openalex.org/W1489374747","https://openalex.org/W1548880861","https://openalex.org/W1577115042","https://openalex.org/W1579247651","https://openalex.org/W1981324778","https://openalex.org/W2001539364","https://openalex.org/W2011086847","https://openalex.org/W2011277321","https://openalex.org/W2025130727","https://openalex.org/W2060463058","https://openalex.org/W2061056562","https://openalex.org/W2062740098","https://openalex.org/W2069792094","https://openalex.org/W2072482695","https://openalex.org/W2072824406","https://openalex.org/W2086747974","https://openalex.org/W2126267504","https://openalex.org/W2145188057","https://openalex.org/W2159543798","https://openalex.org/W2167297340","https://openalex.org/W2201750573","https://openalex.org/W2230451675","https://openalex.org/W2290798421","https://openalex.org/W2337950517","https://openalex.org/W2399200320","https://openalex.org/W2463218253","https://openalex.org/W2499905456","https://openalex.org/W2533836568","https://openalex.org/W2547267640","https://openalex.org/W2625940422","https://openalex.org/W2886288580","https://openalex.org/W2952595174","https://openalex.org/W2979771948","https://openalex.org/W3101926357","https://openalex.org/W4410352943","https://openalex.org/W6605349438"],"related_works":["https://openalex.org/W1548115644","https://openalex.org/W1537230380","https://openalex.org/W1524684967","https://openalex.org/W2132910148","https://openalex.org/W2029183607","https://openalex.org/W2082636129","https://openalex.org/W1572916600","https://openalex.org/W2086025566","https://openalex.org/W2161801419","https://openalex.org/W270168689"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,11,30,49,66,81],"Coq":[3],"library":[4],"that":[5,10,73],"allows":[6],"for":[7],"readily":[8],"proving":[9],"function":[12],"is":[13,19,48],"computable":[14,38],"in":[15,24,39],"polynomial":[16,40],"time.":[17,41],"It":[18],"based":[20],"on":[21],"quasi-interpretations":[22],"that,":[23],"combination":[25],"with":[26],"termination":[27],"ordering,":[28],"provide":[29],"characterisation":[31],"of":[32,36,45,51,68,88],"the":[33,43,58,77,86,95],"class":[34],"fp":[35],"functions":[37],"At":[42],"heart":[44],"this":[46],"formalisation":[47],"proof":[50],"soundness":[52],"and":[53,79],"extensional":[54],"completeness.":[55],"Compared":[56],"to":[57,64,76,94],"original":[59],"paper":[60],"proof,":[61],"we":[62,91],"had":[63],"fill":[65],"lot":[67],"not":[69],"so":[70],"trivial":[71],"details":[72],"were":[74],"left":[75],"reader":[78],"fix":[80],"few":[82],"glitches.":[83],"To":[84],"demonstrate":[85],"usability":[87],"our":[89],"library,":[90],"apply":[92],"it":[93],"modular":[96],"exponentiation.":[97]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}