{"id":"https://openalex.org/W2059824826","doi":"https://doi.org/10.1145/2339123.2339124","title":"From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem","display_name":"From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem","publication_year":2012,"publication_date":"2012-08-01","ids":{"openalex":"https://openalex.org/W2059824826","doi":"https://doi.org/10.1145/2339123.2339124","mag":"2059824826"},"language":"en","primary_location":{"id":"doi:10.1145/2339123.2339124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339123.2339124","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"},"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/A5101621254","display_name":"Yijia Chen","orcid":"https://orcid.org/0009-0006-6986-6736"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yijia Chen","raw_affiliation_strings":["Shanghai Jiaotong University","Shanghai JiaoTong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiaotong University","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Shanghai JiaoTong University","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113696666","display_name":"J\u00f6rg Flum","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Flum","raw_affiliation_strings":["Albert-Ludwigs-Universit\u00e4t Freiburg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-Universit\u00e4t Freiburg","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.34,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62417013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"59","issue":"4","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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.9986000061035156,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8670593500137329},{"id":"https://openalex.org/keywords/halting-problem","display_name":"Halting problem","score":0.7632034420967102},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7151079773902893},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6527783274650574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5921221971511841},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5409238934516907},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5179797410964966},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.48522448539733887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4535145163536072},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.43058058619499207},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4288646876811981},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4247603118419647},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.34233707189559937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3351493775844574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.328258752822876},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08639436960220337}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8670593500137329},{"id":"https://openalex.org/C137343475","wikidata":"https://www.wikidata.org/wiki/Q622849","display_name":"Halting problem","level":4,"score":0.7632034420967102},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7151079773902893},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6527783274650574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5921221971511841},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5409238934516907},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5179797410964966},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.48522448539733887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4535145163536072},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.43058058619499207},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4288646876811981},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4247603118419647},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.34233707189559937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3351493775844574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.328258752822876},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08639436960220337},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2339123.2339124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339123.2339124","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1483648039","https://openalex.org/W1504704680","https://openalex.org/W1511738550","https://openalex.org/W1518766236","https://openalex.org/W1543802741","https://openalex.org/W1570425181","https://openalex.org/W1577561363","https://openalex.org/W1712906147","https://openalex.org/W1947815668","https://openalex.org/W1970629906","https://openalex.org/W1984890936","https://openalex.org/W1987520994","https://openalex.org/W1988083342","https://openalex.org/W1989783863","https://openalex.org/W2043360684","https://openalex.org/W2080818057","https://openalex.org/W2088094394","https://openalex.org/W2100570449","https://openalex.org/W2105164834","https://openalex.org/W2116278910","https://openalex.org/W2171353564","https://openalex.org/W2278335590","https://openalex.org/W2561675875","https://openalex.org/W2913688336","https://openalex.org/W3105529609","https://openalex.org/W3127113455","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W151907561","https://openalex.org/W2089690927","https://openalex.org/W2134311920","https://openalex.org/W2798907744","https://openalex.org/W4366344914","https://openalex.org/W2021218132","https://openalex.org/W1793599134","https://openalex.org/W3188570942","https://openalex.org/W2025376368","https://openalex.org/W2059824826"],"abstract_inverted_index":{"Let":[0],"C":[1,34,46,70],"denote":[2],"one":[3],"of":[4,26,51,53,64,67,71],"the":[5,27,48,62,80,90],"complexity":[6,92],"classes":[7],"\u201cpolynomial":[8],"time,\u201d":[9],"\u201clogspace,\u201d":[10],"or":[11],"\u201cnondeterministic":[12],"logspace.\u201d":[13],"We":[14],"introduce":[15],"a":[16,65,83],"logic":[17],"L":[18,30],"(C)":[19,31],"inv":[20,32],"and":[21,24,36,77],"show":[22],"generalizations":[23],"variants":[25],"equivalence":[28],"(":[29],"captures":[33],"if":[35,38],"only":[37],"there":[39],"is":[40,88],"an":[41],"almost":[42],"C-optimal":[43],"algorithm":[44],"in":[45,69,89],"for":[47],"set":[49],"Taut":[50,72],"tautologies":[52],"propositional":[54],"logic).":[55],"These":[56],"statements":[57],"are":[58],"also":[59],"equivalent":[60,78],"to":[61,79],"existence":[63],"listing":[66],"subsets":[68],"by":[73],"corresponding":[74],"Turing":[75],"machines":[76],"fact":[81],"that":[82],"certain":[84],"parameterized":[85,91],"halting":[86],"problem":[87],"class":[93],"XC":[94],"uni":[95],".":[96]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}