{"id":"https://openalex.org/W2345167136","doi":"https://doi.org/10.1145/2893582.2893588","title":"Variants of Courcelle's Theorem for complexity classes inside P","display_name":"Variants of Courcelle's Theorem for complexity classes inside P","publication_year":2016,"publication_date":"2016-02-17","ids":{"openalex":"https://openalex.org/W2345167136","doi":"https://doi.org/10.1145/2893582.2893588","mag":"2345167136"},"language":"en","primary_location":{"id":"doi:10.1145/2893582.2893588","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2893582.2893588","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2893582.2893588?download=true","source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"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":"ACM SIGLOG News","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2893582.2893588?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031690987","display_name":"Michael Elberfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Elberfeld","raw_affiliation_strings":["RWTH Aachen University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031690987"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04391376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"1","first_page":"23","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9961000084877014,"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.9959999918937683,"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/bounded-function","display_name":"Bounded function","score":0.669203519821167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5429645776748657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5075084567070007},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45250049233436584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43658873438835144},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42726603150367737},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.419631689786911},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41612708568573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1447685956954956},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06575199961662292}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.669203519821167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5429645776748657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5075084567070007},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45250049233436584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43658873438835144},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42726603150367737},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.419631689786911},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41612708568573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1447685956954956},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06575199961662292}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2893582.2893588","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2893582.2893588","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2893582.2893588?download=true","source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"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":"ACM SIGLOG News","raw_type":"journal-article"},{"id":"pmh:oai:publications.rwth-aachen.de:668298","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/668298","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM SIGLOG news 3, 23-32 (2016). doi:10.1145/2893582.2893588","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/2893582.2893588","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2893582.2893588","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2893582.2893588?download=true","source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"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":"ACM SIGLOG News","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W41330591","https://openalex.org/W1490189322","https://openalex.org/W1516002824","https://openalex.org/W1570425181","https://openalex.org/W1573451721","https://openalex.org/W1836127928","https://openalex.org/W1971056052","https://openalex.org/W1985953373","https://openalex.org/W1989887898","https://openalex.org/W1990870868","https://openalex.org/W2005079828","https://openalex.org/W2006912660","https://openalex.org/W2011039300","https://openalex.org/W2017205387","https://openalex.org/W2017492235","https://openalex.org/W2018791466","https://openalex.org/W2024091095","https://openalex.org/W2049516232","https://openalex.org/W2071108434","https://openalex.org/W2096113666","https://openalex.org/W2119468705","https://openalex.org/W2119630998","https://openalex.org/W2159366821","https://openalex.org/W2170477095","https://openalex.org/W2170478756","https://openalex.org/W2748837517","https://openalex.org/W2923266965","https://openalex.org/W2952362598","https://openalex.org/W3032071526"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W4386900933","https://openalex.org/W4385301946","https://openalex.org/W4297797135","https://openalex.org/W3125672081","https://openalex.org/W1673581201","https://openalex.org/W2991991550","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"It":[0],"is":[1,39,49],"well":[2],"known":[3],"that":[4,21],"monadic-second":[5],"order":[6],"logic":[7],"(MSO)":[8],"expresses":[9],"many":[10],"natural":[11,91],"NP-complete":[12],"problems.":[13,69,94],"However,":[14],"a":[15,42,65,73],"famous":[16],"theorem":[17],"of":[18,53,68,75,79,90,93],"Courcelle":[19],"states":[20,59],"every":[22],"problem":[23],"expressible":[24],"in":[25,30],"MSO":[26],"can":[27],"be":[28],"solved":[29],"linear":[31],"time":[32],"for":[33,64],"input":[34],"graphs":[35],"whose":[36],"tree":[37],"width":[38],"bounded":[40],"by":[41,84],"fixed":[43],"constant":[44],"[Courcelle":[45],"1990].":[46],"Courcelle's":[47,82],"Theorem":[48,83],"the":[50,88],"prototypical":[51],"example":[52],"an":[54,60],"algorithmic":[55,61],"\"meta":[56],"theorem\",":[57],"which":[58,80],"upper":[62],"bound":[63],"whole":[66],"family":[67],"This":[70],"column":[71],"reviews":[72],"series":[74],"meta":[76],"theorems":[77],"several":[78],"refine":[81],"more":[85],"precisely":[86],"classifying":[87],"complexity":[89],"families":[92]},"counts_by_year":[],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}