{"id":"https://openalex.org/W3044065395","doi":"https://doi.org/10.1145/3417759","title":"On Existential MSO and Its Relation to ETH","display_name":"On Existential MSO and Its Relation to ETH","publication_year":2020,"publication_date":"2020-09-30","ids":{"openalex":"https://openalex.org/W3044065395","doi":"https://doi.org/10.1145/3417759","mag":"3044065395"},"language":"en","primary_location":{"id":"doi:10.1145/3417759","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3417759","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Transactions on Computation Theory","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/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068702258","display_name":"Ronald de Haan","orcid":"https://orcid.org/0000-0003-2023-0586"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ronald de Haan","raw_affiliation_strings":["Institute for Logic, Language and Computation, University of Amsterdam"],"affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation, University of Amsterdam","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad Kanj","raw_affiliation_strings":["School of Computing, DePaul University"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088116512"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1208883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9972000122070312,"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/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.858006477355957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6897343397140503},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6847323775291443},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6009359955787659},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5638871788978577},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5430784225463867},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46656739711761475},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4662220776081085},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4537825584411621},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.44347333908081055},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.44015973806381226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36404114961624146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2141319215297699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.202768474817276},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.17219820618629456},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16203460097312927}],"concepts":[{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.858006477355957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6897343397140503},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6847323775291443},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6009359955787659},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5638871788978577},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5430784225463867},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46656739711761475},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4662220776081085},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4537825584411621},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.44347333908081055},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.44015973806381226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36404114961624146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2141319215297699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.202768474817276},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.17219820618629456},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16203460097312927},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","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},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3417759","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3417759","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/dc7802f4-48bb-47ab-8f73-eb4b2da178df","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-existential-mso-and-its-relation-to-eth(dc7802f4-48bb-47ab-8f73-eb4b2da178df).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ganian, R, de Haan, R, Kanj, I & Szeider, S 2020, 'On Existential MSO and its Relation to ETH', ACM Transactions on Computation Theory, vol. 12, no. 4, 22. https://doi.org/10.1145/3417759","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/dc7802f4-48bb-47ab-8f73-eb4b2da178df","is_oa":false,"landing_page_url":"https://hdl.handle.net/11245.1/dc7802f4-48bb-47ab-8f73-eb4b2da178df","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ganian, R, de Haan, R, Kanj, I & Szeider, S 2020, 'On Existential MSO and its Relation to ETH', ACM Transactions on Computation Theory, vol. 12, no. 4, 22. https://doi.org/10.1145/3417759","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/dc7802f4-48bb-47ab-8f73-eb4b2da178df","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/on-existential-mso-and-its-relation-to-eth(dc7802f4-48bb-47ab-8f73-eb4b2da178df).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computation Theory, 12(4):22. Association for Computing Machinery (ACM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G29884786","display_name":null,"funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1489366126","https://openalex.org/W1536829117","https://openalex.org/W1604399776","https://openalex.org/W1623604111","https://openalex.org/W1764956874","https://openalex.org/W1895777545","https://openalex.org/W1985573889","https://openalex.org/W1993953362","https://openalex.org/W1995725694","https://openalex.org/W2003895694","https://openalex.org/W2015963099","https://openalex.org/W2023552332","https://openalex.org/W2025800967","https://openalex.org/W2031470081","https://openalex.org/W2038225707","https://openalex.org/W2055693471","https://openalex.org/W2058258808","https://openalex.org/W2085716675","https://openalex.org/W2100609826","https://openalex.org/W2119342546","https://openalex.org/W2121770144","https://openalex.org/W2130190334","https://openalex.org/W2150004999","https://openalex.org/W2157494948","https://openalex.org/W2158951688","https://openalex.org/W2159892713","https://openalex.org/W2171680292","https://openalex.org/W2171850910","https://openalex.org/W2207058206","https://openalex.org/W2249739104","https://openalex.org/W2252464404","https://openalex.org/W2913688336","https://openalex.org/W2914414140","https://openalex.org/W2951454425","https://openalex.org/W3127113455","https://openalex.org/W4236835455","https://openalex.org/W4292230561","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W1582633789","https://openalex.org/W1902289782","https://openalex.org/W2397546146","https://openalex.org/W1525612881","https://openalex.org/W2008735821","https://openalex.org/W3094951835","https://openalex.org/W2964237202","https://openalex.org/W2094354112","https://openalex.org/W2079745007","https://openalex.org/W1560572178"],"abstract_inverted_index":{"Impagliazzo":[0,55,255],"et":[1,56,256],"al.":[2,57,257],"proposed":[3,164],"a":[4,60,76,99,105,144],"framework,":[5],"based":[6],"on":[7],"the":[8,12,39,42,52,111,115,133,148,151,154,171,184,200,225,235,241,252,282],"logic":[9,95,156,232],"fragment":[10,157,243],"defining":[11],"complexity":[13,77,106,185],"class":[14,134,146,165],"SNP,":[15,245],"to":[16,22,68,80,124,158,176,224],"identify":[17,59],"problems":[18,37,64,89,136,177,197,237],"that":[19,65,85,129,189,234,261],"are":[20,66,238,248],"equivalent":[21,67,223],"k":[23,69],"-CNF-":[24,70],"Sat":[25,71],"modulo":[26,72],"subexponential-time":[27,31,220],"reducibility":[28],"(serf-reducibility).":[29],"The":[30,163],"solvability":[32,221],"of":[33,35,41,54,63,87,104,114,135,153,173,202,216,227,244,254,284,293],"any":[34,215],"these":[36,217],"implies":[38],"failure":[40,226],"Exponential":[43],"Time":[44],"Hypothesis":[45],"(ETH).":[46],"In":[47],"this":[48],"article,":[49],"we":[50,259],"extend":[51],"framework":[53,253],"and":[58,210,246,272,280,295],"larger":[61],"set":[62],"serf-reducibility.":[73],"We":[74,187,229],"propose":[75],"class,":[78],"referred":[79],"as":[81,199],"Linear":[82,166,190,277],"Monadic":[83,142,167,174,191,278],"NP,":[84,143,279],"consists":[86],"all":[88],"expressible":[90,137],"in":[91,102,138,147,183,240,267,276],"existential":[92,139,159,268],"monadic":[93,160,242,269],"second-order":[94,140,161,270],"whose":[96,178],"expressions":[97,179],"have":[98,180],"linear":[100,181],"measure":[101,182],"terms":[103],"parameter,":[107],"which":[108],"is":[109,150,169,222,265,274],"usually":[110],"universe":[112],"size":[113],"problem.":[116],"This":[117],"research":[118],"direction":[119],"can":[120],"be":[121],"traced":[122],"back":[123],"Fagin\u2019s":[125],"celebrated":[126],"theorem":[127],"stating":[128],"NP":[130,168,175,192],"coincides":[131],"with":[132],"logic.":[141,162],"well-studied":[145],"literature,":[149],"restriction":[152,172],"aforementioned":[155,236],"then":[170],"parameter.":[186],"show":[188,260],"includes":[193],"many":[194],"natural":[195],"complete":[196],"such":[198],"satisfiability":[201],"linear-size":[203],"circuits,":[204],"dominating":[205,208],"set,":[206,209],"independent":[207],"perfect":[211],"code.":[212],"Therefore,":[213],"for":[214],"problems,":[218],"its":[219],"ETH.":[228],"prove,":[230],"using":[231],"games,":[233],"inexpressible":[239,266],"hence,":[247],"not":[249,275],"captured":[250],"by":[251],"Finally,":[258],"Feedback":[262,288],"Vertex":[263,289],"Set":[264,290],"logic,":[271],"hence":[273],"investigate":[281],"existence":[283],"certain":[285],"reductions":[286],"between":[287],"(and":[291],"variants":[292],"it)":[294],"3-CNF-Sat":[296],".":[297]},"counts_by_year":[],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}