{"id":"https://openalex.org/W3195027657","doi":"https://doi.org/10.1137/19m128466x","title":"A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP","display_name":"A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3195027657","doi":"https://doi.org/10.1137/19m128466x","mag":"3195027657"},"language":"en","primary_location":{"id":"doi:10.1137/19m128466x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m128466x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5058729018","display_name":"Manuel Bodirsky","orcid":"https://orcid.org/0000-0001-8228-3611"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Manuel Bodirsky","raw_affiliation_strings":["TU Dresden - Technische Universit\u00e4t Dresden = Dresden University of Technology (TU Dresden 01062 Dresden - Germany)"],"affiliations":[{"raw_affiliation_string":"TU Dresden - Technische Universit\u00e4t Dresden = Dresden University of Technology (TU Dresden 01062 Dresden - Germany)","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044720498","display_name":"Florent Madelaine","orcid":"https://orcid.org/0000-0002-8528-7105"},"institutions":[{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]},{"id":"https://openalex.org/I2800365227","display_name":"Paris-Est Sup","ror":"https://ror.org/0268ecp52","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Florent Madelaine","raw_affiliation_strings":["UPEC UP12 - Universit\u00e9 Paris-Est Cr\u00e9teil Val-de-Marne - Paris 12 (61 avenue du G\u00e9n\u00e9ral de Gaulle - 94010 Cr\u00e9teil cedex - France)","LACL - Laboratoire d'Algorithmique Complexit\u00e9 et Logique (LACL, Universit\u00e9 Paris-Est Cr\u00e9teil Val-de-Marne, 61 avenue du G\u00e9n\u00e9ral de Gaulle 94010 Cr\u00e9teil cedex - France)","IUTSF - IUT S\u00e9nart-Fontainebleau (Route foresti\u00e8re Hurtault, Route Foresti\u00e8re de la G\u00e9nisse, 77300 Fontainebleau - France)"],"affiliations":[{"raw_affiliation_string":"UPEC UP12 - Universit\u00e9 Paris-Est Cr\u00e9teil Val-de-Marne - Paris 12 (61 avenue du G\u00e9n\u00e9ral de Gaulle - 94010 Cr\u00e9teil cedex - France)","institution_ids":["https://openalex.org/I197681013"]},{"raw_affiliation_string":"LACL - Laboratoire d'Algorithmique Complexit\u00e9 et Logique (LACL, Universit\u00e9 Paris-Est Cr\u00e9teil Val-de-Marne, 61 avenue du G\u00e9n\u00e9ral de Gaulle 94010 Cr\u00e9teil cedex - France)","institution_ids":["https://openalex.org/I2800365227","https://openalex.org/I197681013"]},{"raw_affiliation_string":"IUTSF - IUT S\u00e9nart-Fontainebleau (Route foresti\u00e8re Hurtault, Route Foresti\u00e8re de la G\u00e9nisse, 77300 Fontainebleau - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021389919","display_name":"Antoine Mottet","orcid":"https://orcid.org/0000-0002-3517-1745"},"institutions":[{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Antoine Mottet","raw_affiliation_strings":["TUHH - Technische Universit\u00e4t Hamburg-Harburg (Am Schwarzenberg-Campus 1, 21073 Hamburg - Germany)"],"affiliations":[{"raw_affiliation_string":"TUHH - Technische Universit\u00e4t Hamburg-Harburg (Am Schwarzenberg-Campus 1, 21073 Hamburg - Germany)","institution_ids":["https://openalex.org/I884043246"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058729018"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":1.3631,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83804949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"4","first_page":"1359","last_page":"1409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.7114949226379395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6168312430381775},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5441769361495972},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4690347909927368},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4444632828235626},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.4285890758037567},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.379647433757782},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.30407899618148804},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1914578378200531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18058907985687256},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.18019428849220276}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7114949226379395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6168312430381775},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5441769361495972},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4690347909927368},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4444632828235626},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.4285890758037567},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.379647433757782},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.30407899618148804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1914578378200531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18058907985687256},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.18019428849220276},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/19m128466x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m128466x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04097517v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04097517","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2021, 50 (4), pp.1359-1409. ⟨10.1137/19M128466X⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1147712910","display_name":null,"funder_award_id":"771005","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G3198978689","display_name":null,"funder_award_id":"622397","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5675931104","display_name":null,"funder_award_id":"Graduiertenkolleg 1763 (QuantLA)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8548348219","display_name":null,"funder_award_id":"681988","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1866703525","https://openalex.org/W1968276645","https://openalex.org/W1984264511","https://openalex.org/W1985668982","https://openalex.org/W1988705590","https://openalex.org/W2026753685","https://openalex.org/W2041384065","https://openalex.org/W2070051236","https://openalex.org/W2102459557","https://openalex.org/W2108266191","https://openalex.org/W2150339067","https://openalex.org/W2593619415","https://openalex.org/W2963666051","https://openalex.org/W3014119257","https://openalex.org/W3029699236","https://openalex.org/W3101271171","https://openalex.org/W3103815471","https://openalex.org/W3104398743","https://openalex.org/W3105924413","https://openalex.org/W4230417672"],"related_works":["https://openalex.org/W4301895170","https://openalex.org/W3194471551","https://openalex.org/W2163760347","https://openalex.org/W2963936214","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W2610026222","https://openalex.org/W1668658774","https://openalex.org/W4297950433"],"abstract_inverted_index":{"The":[0,24,82],"logic":[1,10,25],"MMSNP":[2,36,113],"is":[3,38],"a":[4,42,64,90,116,128],"restricted":[5],"fragment":[6],"of":[7,59,67,80,119,131],"existential":[8],"second-order":[9],"which":[11],"can":[12,137],"express":[13],"many":[14],"interesting":[15],"queries":[16],"in":[17,104],"graph":[18],"theory":[19],"and":[20,30,93,133,147],"finite":[21,117,144],"model":[22],"theory.":[23],"was":[26],"introduced":[27],"by":[28,54,127],"Feder":[29],"Vardi,":[31],"who":[32],"showed":[33],"that":[34,73,111],"every":[35,112],"sentence":[37,114],"computationally":[39],"equivalent":[40],"to":[41,70,88,94,140],"finite-domain":[43,71],"constraint":[44],"satisfaction":[45],"problem":[46],"(CSP);":[47],"the":[48,68,78,96,109,148],"involved":[49],"probabilistic":[50],"reductions":[51],"were":[52],"derandomized":[53],"Kun":[55],"using":[56],"explicit":[57],"constructions":[58],"expander":[60],"structures.":[61],"We":[62],"present":[63],"new":[65,83],"proof":[66,85],"reduction":[69],"CSPs":[72,103,120],"does":[74],"not":[75],"rely":[76],"on":[77],"results":[79],"Kun.":[81],"universal-algebraic":[84],"allows":[86],"us":[87],"obtain":[89],"stronger":[91],"statement":[92],"verify":[95],"more":[97],"general":[98],"Bodirsky--Pinsker":[99],"dichotomy":[100],"conjecture":[101],"for":[102,121],"MMSNP.":[105],"Our":[106],"approach":[107],"uses":[108],"fact":[110],"describes":[115],"union":[118],"countably":[122],"infinite":[123],"$\\omega$-categorical":[124],"structures;":[125],"moreover,":[126],"recent":[129],"result":[130],"Hubi\u010dka":[132],"Ne\u0161et\u0159il,":[134],"these":[135],"structures":[136,142],"be":[138],"expanded":[139],"homogeneous":[141],"with":[143],"relational":[145],"signature":[146],"Ramsey":[149],"property.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}