{"id":"https://openalex.org/W2751513393","doi":"https://doi.org/10.2168/lmcs-8(1:27)2012","title":"On the Parameterized Intractability of Monadic Second-Order Logic","display_name":"On the Parameterized Intractability of Monadic Second-Order Logic","publication_year":2012,"publication_date":"2012-03-26","ids":{"openalex":"https://openalex.org/W2751513393","doi":"https://doi.org/10.2168/lmcs-8(1:27)2012","mag":"2751513393"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(1:27)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:27)2012","pdf_url":"https://lmcs.episciences.org/785/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/785/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Stephan Kreutzer","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stephan Kreutzer","raw_affiliation_strings":["School for Electrical Engineering and Computer Science, Technical University Berlin, Sekr. TEL 7-1, Ernst-Reuter-Platz 7, 10587 Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"School for Electrical Engineering and Computer Science, Technical University Berlin, Sekr. TEL 7-1, Ernst-Reuter-Platz 7, 10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":1.0368,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79734288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"Volume 8, 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.49230000376701355,"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.49230000376701355,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.35089999437332153,"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.027000000700354576,"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.8356999754905701},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6499000191688538},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6067000031471252},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5249000191688538},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.43369999527931213},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.41830000281333923},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.38420000672340393}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8356999754905701},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6499000191688538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6312000155448914},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6067000031471252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5834000110626221},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5249000191688538},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.43369999527931213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41850000619888306},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.41830000281333923},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.38420000672340393},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.367900013923645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.34299999475479126},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.2809999883174896}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-8(1:27)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:27)2012","pdf_url":"https://lmcs.episciences.org/785/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:1203.3167","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1203.3167","pdf_url":"https://arxiv.org/pdf/1203.3167","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:9bf3a047acd1443c96043b790e3fed66","is_oa":true,"landing_page_url":"https://doaj.org/article/9bf3a047acd1443c96043b790e3fed66","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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 8, Issue 1 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(1:27)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:27)2012","pdf_url":"https://lmcs.episciences.org/785/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":[{"id":"https://openalex.org/G7545433334","display_name":null,"funder_award_id":"KR 2898/1-3","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320329205","display_name":"Banff International Research Station for Mathematical Innovation and Discovery","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2751513393.pdf","grobid_xml":"https://content.openalex.org/works/W2751513393.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W33764387","https://openalex.org/W1527664624","https://openalex.org/W1579643516","https://openalex.org/W1967546560","https://openalex.org/W1973819999","https://openalex.org/W1989556004","https://openalex.org/W1989783863","https://openalex.org/W2008440715","https://openalex.org/W2011911122","https://openalex.org/W2032950184","https://openalex.org/W2037106315","https://openalex.org/W2048685245","https://openalex.org/W2053991811","https://openalex.org/W2057826895","https://openalex.org/W2084389562","https://openalex.org/W2085348754","https://openalex.org/W2124442576","https://openalex.org/W2126513401","https://openalex.org/W2132914818","https://openalex.org/W2950434194","https://openalex.org/W2952680644","https://openalex.org/W3032071526","https://openalex.org/W4213232386","https://openalex.org/W4237721941","https://openalex.org/W4292230561","https://openalex.org/W6629125001"],"related_works":[],"abstract_inverted_index":{"One":[0],"of":[1,12,14,45,66,77,96,114,139],"Courcelle's":[2],"celebrated":[3],"results":[4],"states":[5],"that":[6,74,90,111],"if":[7,91],"C":[8,30,92,115,140],"is":[9,25,39,51,54,93,99,109,116,125,141,148],"a":[10,94],"class":[11,95],"graphs":[13,97],"bounded":[15,118],"tree-width,":[16,78],"then":[17,122,145],"model-checking":[18],"for":[19],"monadic":[20],"second":[21],"order":[22],"logic":[23],"(MSO_2)":[24],"fixed-parameter":[26],"tractable":[27],"(fpt)":[28],"on":[29],"by":[31,119],"linear":[32],"time":[33],"parameterized":[34],"algorithms,":[35],"where":[36],"the":[37,40,43,46,59,79,112,137,155],"parameter":[38],"tree-width":[41,113,138],"plus":[42],"size":[44],"formula.":[47],"An":[48],"immediate":[49],"question":[50],"whether":[52,58],"this":[53,70],"best":[55],"possible":[56],"or":[57],"result":[60],"can":[61,130,158],"be":[62,82,131,159],"extended":[63,83],"to":[64],"classes":[65],"unbounded":[67],"tree-width.":[68],"In":[69],"paper":[71],"we":[72,88],"show":[73,89],"in":[75,133,154,161],"terms":[76],"theorem":[80],"cannot":[81],"much":[84],"further.":[85],"More":[86],"specifically,":[87],"which":[98],"closed":[100],"under":[101],"colourings":[102],"and":[103,108],"satisfies":[104],"certain":[105],"constructibility":[106],"conditions":[107],"such":[110],"not":[117,126,142,149],"\\log^{84}":[120],"n":[121],"MSO_2-model":[123,146],"checking":[124,147],"fpt":[127,150],"unless":[128,151],"SAT":[129],"solved":[132,160],"sub-exponential":[134,162],"time.":[135,163],"If":[136],"poly-logarithmically":[143],"bounded,":[144],"all":[152],"problems":[153],"polynomial-time":[156],"hierarchy":[157]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2017-09-15T00:00:00"}