{"id":"https://openalex.org/W2950434194","doi":"https://doi.org/10.2168/lmcs-1(1:2)2005","title":"Model-Checking Problems as a Basis for Parameterized Intractability","display_name":"Model-Checking Problems as a Basis for Parameterized Intractability","publication_year":2005,"publication_date":"2005-03-07","ids":{"openalex":"https://openalex.org/W2950434194","doi":"https://doi.org/10.2168/lmcs-1(1:2)2005","mag":"2950434194"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-1(1:2)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(1:2)2005","pdf_url":"https://lmcs.episciences.org/2272/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2272/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113660857","display_name":"J. 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":true,"raw_author_name":"Joerg Flum","raw_affiliation_strings":["Abteilung fr Mathematische Logik, Albert-Ludwigs-Universitt, Eckerstr. 1, 79104 Freiburg, Germany","Abteilung f\u00fcr Mathematische Logik, Albert-Ludwigs-Universit\u00e4t, Eckerstr. 1, 79104 Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Abteilung fr Mathematische Logik, Albert-Ludwigs-Universitt, Eckerstr. 1, 79104 Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Abteilung f\u00fcr Mathematische Logik, Albert-Ludwigs-Universit\u00e4t, Eckerstr. 1, 79104 Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["Institut fr Informatik, Humboldt-Universitt, Unter den Linden 6, 10099 Berlin, Germany","Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t, Unter den Linden 6, 10099 Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-0292-9142","affiliations":[{"raw_affiliation_string":"Institut fr Informatik, Humboldt-Universitt, Unter den Linden 6, 10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t, Unter den Linden 6, 10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113660857"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":9.7831,"has_fulltext":true,"cited_by_count":40,"citation_normalized_percentile":{"value":0.9878418,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 1, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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.9818000197410583,"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.9789000153541565,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9320178627967834},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.8274050951004028},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.7620064616203308},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6744275093078613},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6634336709976196},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.531830370426178},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.510153591632843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5034539103507996},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.43145787715911865},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.423086941242218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41161012649536133},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3995519280433655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3972175419330597},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.31518757343292236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23192089796066284}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9320178627967834},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.8274050951004028},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.7620064616203308},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6744275093078613},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6634336709976196},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.531830370426178},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.510153591632843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5034539103507996},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.43145787715911865},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.423086941242218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41161012649536133},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3995519280433655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3972175419330597},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31518757343292236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23192089796066284},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-1(1:2)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(1:2)2005","pdf_url":"https://lmcs.episciences.org/2272/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0502005","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0502005","pdf_url":"https://arxiv.org/pdf/cs/0502005","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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:900afb23d55b40dea661ca679cd608ba","is_oa":true,"landing_page_url":"https://doaj.org/article/900afb23d55b40dea661ca679cd608ba","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 1, Issue 1 (2005)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-1(1:2)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(1:2)2005","pdf_url":"https://lmcs.episciences.org/2272/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2950434194.pdf","grobid_xml":"https://content.openalex.org/works/W2950434194.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1579643516","https://openalex.org/W1989783863","https://openalex.org/W2003227046","https://openalex.org/W2018964411","https://openalex.org/W2022841964","https://openalex.org/W2046652577","https://openalex.org/W2055423880","https://openalex.org/W2061513598","https://openalex.org/W2066585576","https://openalex.org/W2090398333","https://openalex.org/W2113743851","https://openalex.org/W2137931097","https://openalex.org/W2171984098","https://openalex.org/W2394942112","https://openalex.org/W2579801771","https://openalex.org/W2623947920","https://openalex.org/W2913688336","https://openalex.org/W3127113455","https://openalex.org/W4242101141","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W3042708252","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W4281812495","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2127594621"],"abstract_inverted_index":{"Most":[0],"parameterized":[1,10,119,143],"complexity":[2,120,144],"classes":[3,121],"are":[4,34,42],"defined":[5],"in":[6,46,79,122],"terms":[7,47,80],"of":[8,12,29,48,54,76,81,113,115,135,137,141],"a":[9,66,74,92],"version":[11],"the":[13,39,62,69,77,102,105,116,138],"Boolean":[14],"satisfiability":[15,20,97],"problem":[16],"(the":[17],"so-called":[18],"weighted":[19,96],"problem).":[21],"For":[22],"example,":[23,38],"Downey":[24],"and":[25,59,89,98,104],"Fellow's":[26],"W-hierarchy":[27,78],"is":[28],"this":[30],"form.":[31],"But":[32],"there":[33],"also":[35],"classes,":[36],"for":[37,51,101],"A-hierarchy,":[40],"that":[41],"more":[43],"naturally":[44],"characterised":[45],"model-checking":[49,83,99],"problems":[50,100],"certain":[52],"fragments":[53],"first-order":[55,82],"logic.":[56],"Downey,":[57],"Fellows,":[58],"Regan":[60],"were":[61],"first":[63],"to":[64,130],"establish":[65],"connection":[67],"between":[68,95],"two":[70],"formalisms":[71],"by":[72],"giving":[73],"characterisation":[75],"problems.":[84],"We":[85],"improve":[86],"their":[87],"result":[88],"then":[90],"prove":[91],"similar":[93],"correspondence":[94],"A-hierarchy":[103],"W^*-hierarchy.":[106],"Thus":[107],"we":[108],"obtain":[109],"very":[110],"uniform":[111],"characterisations":[112],"many":[114],"most":[117],"important":[118],"both":[123],"formalisms.":[124],"Our":[125],"results":[126,140],"can":[127],"be":[128],"used":[129],"give":[131],"new,":[132],"simple":[133],"proofs":[134],"some":[136],"core":[139],"structural":[142],"theory.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}