{"id":"https://openalex.org/W2081052991","doi":"https://doi.org/10.1093/logcom/exh036","title":"Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time","display_name":"Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time","publication_year":2005,"publication_date":"2005-02-01","ids":{"openalex":"https://openalex.org/W2081052991","doi":"https://doi.org/10.1093/logcom/exh036","mag":"2081052991"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exh036","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exh036","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","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/A5067372819","display_name":"Olivier Bournez","orcid":"https://orcid.org/0000-0002-9218-1130"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"O. Bournez","raw_affiliation_strings":["INRIA/LORIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France. E-mail: Olivier.Bournez@loria.fr,#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA/LORIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France. E-mail: Olivier.Bournez@loria.fr,#TAB#","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067372819"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":1.6831,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8468702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"1","first_page":"41","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8855951428413391},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6297403573989868},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6060962080955505},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5948650240898132},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5127121210098267},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.49513211846351624},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.466613233089447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45637571811676025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41248995065689087},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41184136271476746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2861889600753784}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8855951428413391},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6297403573989868},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6060962080955505},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5948650240898132},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5127121210098267},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.49513211846351624},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.466613233089447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45637571811676025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41248995065689087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41184136271476746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2861889600753784},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exh036","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exh036","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:HAL:inria-00102942v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00102942","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":"Journal of Logic and Computation, 2005, 15 (1), pp.41--58","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309893","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23"},{"id":"https://openalex.org/F4320322170","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W108460724","https://openalex.org/W1482193060","https://openalex.org/W1505951678","https://openalex.org/W1533996603","https://openalex.org/W1548852834","https://openalex.org/W1550331971","https://openalex.org/W1566708570","https://openalex.org/W1581416890","https://openalex.org/W1608883294","https://openalex.org/W1708892819","https://openalex.org/W1980256844","https://openalex.org/W1981324778","https://openalex.org/W2001022561","https://openalex.org/W2023778211","https://openalex.org/W2030220007","https://openalex.org/W2069792094","https://openalex.org/W2071846104","https://openalex.org/W2074466497","https://openalex.org/W2089982125","https://openalex.org/W2111235650","https://openalex.org/W2159504006","https://openalex.org/W3022332613","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W2161147766","https://openalex.org/W2120210041","https://openalex.org/W1722394934","https://openalex.org/W2964237202","https://openalex.org/W2743728300","https://openalex.org/W2289000419","https://openalex.org/W2295040078","https://openalex.org/W2125536734","https://openalex.org/W3030125579"],"abstract_inverted_index":{"We":[0,23,35,52],"provide":[1,24],"several":[2],"machine-independent":[3],"characterizations":[4],"of":[5,12,27,49,67],"deterministic":[6],"complexity":[7],"classes":[8],"in":[9,47,65],"the":[10],"model":[11],"computation":[13],"proposed":[14],"by":[15],"L.":[16],"Blum,":[17],"M.":[18],"Shub":[19],"and":[20],"S.":[21],"Smale.":[22],"a":[25],"characterization":[26],"partial":[28],"recursive":[29],"functions":[30],"over":[31,40,58],"any":[32],"arbitrary":[33,42,60],"structure.":[34],"show":[36,53],"that":[37,54],"polynomial":[38,55],"time":[39,57],"an":[41,59],"structure":[43,61],"can":[44,62],"be":[45,63],"characterized":[46,64],"terms":[48,66],"safe":[50,68],"recursion.":[51],"parallel":[56],"recursion":[69],"with":[70],"substitutions.":[71]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}