{"id":"https://openalex.org/W2964575026","doi":"https://doi.org/10.1109/lics.2019.8785883","title":"Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)","display_name":"Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2964575026","doi":"https://doi.org/10.1109/lics.2019.8785883","mag":"2964575026"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1901.04237","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Manuel Bodirsky","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU 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":["Institute of Algebra, Technische Universit\u00e4t Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Algebra, Technische Universit\u00e4t Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Antoine Mottet","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Antoine Mottet","raw_affiliation_strings":["Department of Algebra, Charles University in Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, Charles University in Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Miroslav Olsak","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Miroslav Olsak","raw_affiliation_strings":["Department of Algebra, Charles University in Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, Charles University in Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jakub Oprsal","orcid":null},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jakub Oprsal","raw_affiliation_strings":["Department of Computer Science, Durham University Lower Mountjoy, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University Lower Mountjoy, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Michael Pinsker","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michael Pinsker","raw_affiliation_strings":["Department of Algebra, Charles University in Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, Charles University in Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ross Willard","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ross Willard","raw_affiliation_strings":["Department of Pure Mathematics, University of Waterloo Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics, University of Waterloo Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.5987,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70722363,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9987999796867371,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9663000106811523,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7695000171661377},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.664900004863739},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6535000205039978},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.39719998836517334},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.39070001244544983},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.35600000619888306},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.311599999666214}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7799999713897705},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7695000171661377},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.664900004863739},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6535000205039978},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4666000008583069},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41940000653266907},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.39070001244544983},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.311599999666214},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3043999969959259},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C42357961","wikidata":"https://www.wikidata.org/wiki/Q213363","display_name":"Open set","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C180375552","wikidata":"https://www.wikidata.org/wiki/Q2635326","display_name":"Structured program theorem","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/lics.2019.8785883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:28989","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/28989/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"(2019). 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) . : IEEE","raw_type":"Book chapter"},{"id":"pmh:oai:arXiv.org:1901.04237","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.04237","pdf_url":"https://arxiv.org/pdf/1901.04237","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:durham-repository.worktribe.com:1142069","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1142069","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/07666673-fa28-4c89-bcbf-37376bae9546","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/07666673-fa28-4c89-bcbf-37376bae9546","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bodirsky , M , Mottet , A , Ol\u0161\u00e1k , M , Oprsal , J , Pinsker , M & Willard , R 2019 , Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) . in Proceedings - Symposium on Logic in Computer Science . https://doi.org/10.1109/LICS.2019.8785883","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1901.04237","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.04237","pdf_url":"https://arxiv.org/pdf/1901.04237","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W417925666","https://openalex.org/W1526709558","https://openalex.org/W1601269853","https://openalex.org/W1866703525","https://openalex.org/W1967190838","https://openalex.org/W1988705590","https://openalex.org/W2020154454","https://openalex.org/W2026753685","https://openalex.org/W2035932556","https://openalex.org/W2036697315","https://openalex.org/W2099602798","https://openalex.org/W2108266191","https://openalex.org/W2150339067","https://openalex.org/W2243954424","https://openalex.org/W2276690803","https://openalex.org/W2517090651","https://openalex.org/W2593619415","https://openalex.org/W2740483412","https://openalex.org/W2962785950","https://openalex.org/W2963666051","https://openalex.org/W2963710712","https://openalex.org/W2963768895","https://openalex.org/W2964345483","https://openalex.org/W3007452340","https://openalex.org/W3112092492","https://openalex.org/W3144422206","https://openalex.org/W4242963547","https://openalex.org/W6695482473","https://openalex.org/W6696967654","https://openalex.org/W6734840209"],"related_works":[],"abstract_inverted_index":{"The":[0],"algebraic":[1,186],"dichotomy":[2,130],"conjecture":[3,46,131],"for":[4,102,165],"Constraint":[5],"Satisfaction":[6],"Problems":[7],"(CSPs)":[8],"of":[9,11,28,39,53,58,69,76,78,89,106,128,134,141,148,159,179,188],"reducts":[10],"(infinite)":[12],"finitely":[13],"bounded":[14],"homogeneous":[15],"structures":[16,168],"states":[17],"that":[18,153],"such":[19,189],"CSPs":[20],"are":[21],"polynomial-time":[22],"tractable":[23,123],"when":[24],"the":[25,29,40,51,56,67,129,135,138,149,180,185],"model-complete":[26],"core":[27],"template":[30],"has":[31],"a":[32,60,73,94,110],"pseudo-Siggers":[33,61],"polymorphism,":[34],"and":[35,156],"NP-complete":[36],"otherwise.":[37],"One":[38],"important":[41],"questions":[42],"related":[43],"to":[44,50,97],"this":[45,98],"is":[47,122],"whether,":[48],"similarly":[49],"case":[52],"finite":[54],"structures,":[55],"condition":[57,68],"having":[59,70],"polymorphism":[62],"can":[63],"be":[64],"replaced":[65],"by":[66,100,146],"polymorphisms":[71,113,147],"satisfying":[72],"fixed":[74],"set":[75,105],"identities":[77,82,109,145,163],"height":[79,107,143,161],"1,":[80],"i.e.,":[81],"which":[83],"do":[84,114],"not":[85,115],"contain":[86],"any":[87],"nesting":[88],"functional":[90],"symbols.":[91],"We":[92,151],"provide":[93],"negative":[95],"answer":[96],"question":[99],"constructing":[101],"each":[103],"non-trivial":[104],"1":[108,144,162],"structure":[111],"whose":[112,120],"satisfy":[116],"these":[117],"identities,":[118],"but":[119],"CSP":[121,136],"nevertheless.":[124],"An":[125],"equivalent":[126],"formulation":[127],"characterizes":[132],"tractability":[133],"via":[137],"local":[139,154],"satisfaction":[140,155,158],"nontrivial":[142,160],"structure.":[150],"show":[152],"global":[157],"differ":[164],"\u03c9":[166],"-categorical":[167],"with":[169],"less":[170],"than":[171],"double":[172],"exponential":[173],"orbit":[174],"growth,":[175],"thereby":[176],"resolving":[177],"one":[178],"main":[181],"open":[182],"problems":[183],"in":[184],"theory":[187],"structures.":[190]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2019-08-13T00:00:00"}