{"id":"https://openalex.org/W2900179285","doi":"https://doi.org/10.1145/3313276.3316369","title":"The Reachability Problem for Petri Nets Is Not Elementary","display_name":"The Reachability Problem for Petri Nets Is Not Elementary","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2900179285","doi":"https://doi.org/10.1145/3313276.3316369","mag":"2900179285"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316369","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1809.07115","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113969130","display_name":"Wojciech Czerwi\u0144ski","orcid":"https://orcid.org/0000-0002-6169-868X"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Wojciech Czerwi\u0144ski","raw_affiliation_strings":["University of Warsaw, Warszawa, Poland","University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102789796","display_name":"S\u0142awomir Lasota","orcid":"https://orcid.org/0000-0001-8674-4470"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"S\u0142awomir Lasota","raw_affiliation_strings":["University of Warsaw, Warszawa, Poland","University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016064325","display_name":"Ranko Lazi\u0107","orcid":"https://orcid.org/0000-0003-3663-5182"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ranko Lazi\u0107","raw_affiliation_strings":["University of Warwick, UK","University of Warwick"],"affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"University of Warwick","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014652670","display_name":"J\u00e9r\u00f4me Leroux","orcid":"https://orcid.org/0000-0002-7214-9467"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J\u00c9r\u00f4me Leroux","raw_affiliation_strings":["University of Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"University of Bordeaux, France","institution_ids":["https://openalex.org/I15057530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004165473","display_name":"Filip Mazowiecki","orcid":"https://orcid.org/0000-0002-4535-6508"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["DE","FR"],"is_corresponding":false,"raw_author_name":"Filip Mazowiecki","raw_affiliation_strings":["Max Planck Institute for Software Systems, Germany","University of Bordeaux"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Germany","institution_ids":["https://openalex.org/I4210121786"]},{"raw_affiliation_string":"University of Bordeaux","institution_ids":["https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5113969130"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.71355613,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84099374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"68","issue":"1","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9995999932289124,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/reachability","display_name":"Reachability","score":0.9299330711364746},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8905824422836304},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.8282113075256348},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7408040165901184},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6185370087623596},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5656514167785645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5646117329597473},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44288426637649536},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4324132800102234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.429644376039505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37327080965042114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2646641433238983},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18752875924110413}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9299330711364746},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8905824422836304},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.8282113075256348},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7408040165901184},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6185370087623596},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5656514167785645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5646117329597473},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44288426637649536},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4324132800102234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.429644376039505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37327080965042114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2646641433238983},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18752875924110413},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/3313276.3316369","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"doi:10.1145/3422822","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3422822","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1809.07115","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1809.07115","pdf_url":"https://arxiv.org/pdf/1809.07115","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:wrap.warwick.ac.uk:120117","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"},{"id":"mag:2900179285","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1809.07115.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-02390629v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02390629","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019, Jun 2019, Phoenix, United States. pp.24-33, ⟨10.1145/3313276.3316369⟩","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:hal-03436240v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03436240","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM (JACM), 2021, 68 (1), pp.7. ⟨10.1145/3422822⟩","raw_type":"Journal articles"},{"id":"doi:10.48550/arxiv.1809.07115","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1809.07115","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1809.07115","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1809.07115","pdf_url":"https://arxiv.org/pdf/1809.07115","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W166893320","https://openalex.org/W1493373428","https://openalex.org/W1506102917","https://openalex.org/W1545252802","https://openalex.org/W1561267729","https://openalex.org/W1577053809","https://openalex.org/W1591023364","https://openalex.org/W1625359640","https://openalex.org/W1862276852","https://openalex.org/W1932636156","https://openalex.org/W1966307150","https://openalex.org/W1975261774","https://openalex.org/W1989788631","https://openalex.org/W2000116086","https://openalex.org/W2010265885","https://openalex.org/W2011495892","https://openalex.org/W2012140001","https://openalex.org/W2013911710","https://openalex.org/W2017315323","https://openalex.org/W2020050887","https://openalex.org/W2031575609","https://openalex.org/W2036526834","https://openalex.org/W2036564813","https://openalex.org/W2044541206","https://openalex.org/W2049741213","https://openalex.org/W2055081868","https://openalex.org/W2056647002","https://openalex.org/W2073614038","https://openalex.org/W2075742699","https://openalex.org/W2078057071","https://openalex.org/W2078521778","https://openalex.org/W2078846861","https://openalex.org/W2079573613","https://openalex.org/W2091676842","https://openalex.org/W2095655474","https://openalex.org/W2106001218","https://openalex.org/W2110012716","https://openalex.org/W2113615583","https://openalex.org/W2122700562","https://openalex.org/W2164003033","https://openalex.org/W2188682159","https://openalex.org/W2271542264","https://openalex.org/W2344518945","https://openalex.org/W2424307510","https://openalex.org/W2485149744","https://openalex.org/W2563122255","https://openalex.org/W2568513581","https://openalex.org/W2788842818","https://openalex.org/W2922024459","https://openalex.org/W2952863203","https://openalex.org/W2963620995","https://openalex.org/W2963633665","https://openalex.org/W2964347059","https://openalex.org/W2965199304","https://openalex.org/W2999399200","https://openalex.org/W3104838059","https://openalex.org/W3125224867","https://openalex.org/W4213117200","https://openalex.org/W4249920159"],"related_works":["https://openalex.org/W2890492027","https://openalex.org/W2963620995","https://openalex.org/W3028690307","https://openalex.org/W2912654482","https://openalex.org/W3150693775","https://openalex.org/W2949572356","https://openalex.org/W1592552608","https://openalex.org/W2037088969","https://openalex.org/W2506850889","https://openalex.org/W3034977704","https://openalex.org/W2113391671","https://openalex.org/W2294345396","https://openalex.org/W2161984463","https://openalex.org/W2157209432","https://openalex.org/W2275786693","https://openalex.org/W1938261175","https://openalex.org/W3022379598","https://openalex.org/W567211000","https://openalex.org/W3001378189","https://openalex.org/W1844032500"],"abstract_inverted_index":{"Petri":[0,41,234,260,360,397],"nets,":[1],"also":[2,191,239],"known":[3,196,228],"as":[4,28,30],"vector":[5],"addition":[6],"systems,":[7,27,220],"are":[8,227,238,289,315,368],"a":[9,53,127,137,166,211,266,271,302,371],"long":[10],"established":[11],"model":[12],"of":[13,22,55,67,80,89,113,139,141,213,259,278,297,312,329,337,349,373],"concurrency":[14],"with":[15,262,265,280,345,399],"extensive":[16],"applications":[17],"in":[18,86,96,121,159,357,387],"modeling":[19],"and":[20,25,33,76,115,143,223,264,318],"analysis":[21],"hardware,":[23],"software,":[24],"database":[26],"well":[29],"chemical,":[31],"biological,":[32],"business":[34],"processes.":[35],"The":[36,65,161],"central":[37],"algorithmic":[38],"problem":[39,69,135,178],"for":[40,169,200,251,255,392,396],"nets":[42,235,361,398],"is":[43,78,109,165,179,190,300,333],"reachability:":[44],"whether":[45],"from":[46,117,215,232],"the":[47,61,68,74,81,87,104,133,148,176,183,204,233,246,252,295,305,335,342,350,377],"given":[48,62],"initial":[49],"configuration":[50],"there":[51],"exists":[52],"sequence":[54],"valid":[56],"execution":[57],"steps":[58],"that":[59,132,175,210,273,288,314,362],"reaches":[60],"final":[63],"configuration.":[64],"complexity":[66],"has":[70,152,194],"remained":[71],"unsettled":[72],"since":[73,203],"1960s,":[75],"it":[77,173,208,243],"one":[79],"most":[82],"prominent":[83],"open":[84],"questions":[85],"theory":[88],"verification.":[90],"Decidability":[91],"was":[92],"proved":[93],"by":[94,291,320,347,370],"Mayr":[95],"his":[97],"seminal":[98],"STOC":[99],"1981":[100],"work,":[101,147],"and,":[102],"currently,":[103],"best":[105,149,248],"published":[106],"upper":[107],"bound":[108,151,164],"non-primitive":[110],"recursive":[111],"Ackermannian":[112],"Leroux":[114],"Schmitz":[116],"Symposium":[118],"on":[119],"Logic":[120],"Computer":[122],"Science":[123],"2019.":[124],"We":[125,269],"establish":[126,390],"non-elementary":[128,378],"lower":[129,150,163,249,379],"bound,":[130],"i.e.,":[131],"reachability":[134,177,236,253],"needs":[136],"tower":[138,372],"exponentials":[140],"time":[142],"space.":[144],"Until":[145],"this":[146,383],"been":[153,195],"exponential":[154,201],"space,":[155],"due":[156],"to":[157,197,229,283,324,355],"Lipton":[158],"1976.":[160],"new":[162],"major":[167],"breakthrough":[168],"several":[170],"reasons.":[171],"Firstly,":[172],"shows":[174],"much":[180],"harder":[181],"than":[182],"coverability":[184],"(i.e.,":[185],"state":[186],"reachability)":[187],"problem,":[188,237],"which":[189,226,375],"ubiquitous":[192],"but":[193],"be":[198],"complete":[199],"space":[202,395],"late":[205],"1970s.":[206],"Secondly,":[207],"implies":[209],"plethora":[212],"problems":[214,254],"formal":[216],"languages,":[217],"logic,":[218],"concurrent":[219],"process":[221],"calculi,":[222],"other":[224],"areas,":[225],"admit":[230],"reductions":[231],"not":[240],"elementary.":[241],"Thirdly,":[242],"makes":[244],"obsolete":[245],"current":[247],"bounds":[250],"two":[256],"key":[257],"extensions":[258],"nets:":[261],"branching":[263],"pushdown":[267],"stack.":[268],"develop":[270],"construction":[272,352],"uses":[274],"arbitrarily":[275,326],"large":[276,327],"pairs":[277,328],"values":[279,330],"ratio":[281,332],"R":[282,292],"provide":[284],"zero":[285,316],"testable":[286,317],"counters":[287,313,367],"bounded":[290,319,369],".":[293,339],"At":[294],"heart":[296],"our":[298],"proof":[299],"then":[301],"novel":[303],"gadget,":[304],"so-called":[306],"factorial":[307,336,343],"amplifier":[308,344],"that,":[309],"assuming":[310],"availability":[311],"k":[321,338],",":[322],"guarantees":[323],"produce":[325],"whose":[331,366],"exactly":[334],"Repeatedly":[340],"composing":[341],"itself":[346],"means":[348],"former":[351],"enables":[353],"us":[354],"compute,":[356],"linear":[358],"time,":[359],"simulate":[363],"Minsky":[364],"machines":[365],"exponentials,":[374],"yields":[376],"bound.":[380],"By":[381],"refining":[382],"scheme":[384],"further,":[385],"we,":[386],"fact,":[388],"already":[389],"hardness":[391],"h":[393,400],"-exponential":[394],"+":[401],"13":[402],"counters.":[403]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}