{"id":"https://openalex.org/W2966704335","doi":"https://doi.org/10.1109/lics.2019.8785671","title":"Promises Make Finite (Constraint Satisfaction) Problems Infinitary","display_name":"Promises Make Finite (Constraint Satisfaction) Problems Infinitary","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2966704335","doi":"https://doi.org/10.1109/lics.2019.8785671","mag":"2966704335"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785671","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/1909.04878","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Libor Barto","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":true,"raw_author_name":"Libor Barto","raw_affiliation_strings":["Department of Algebra, Charles University Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Algebra, Charles University Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.5779,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69999208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"abs 1811 970","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9894000291824341,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7412999868392944},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6068999767303467},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.48980000615119934},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.4578999876976013},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40119999647140503},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.38029998540878296},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.3564000129699707}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7412999868392944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.632099986076355},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6068999767303467},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.48980000615119934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4726000130176544},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.38029998540878296},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3564000129699707},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34459999203681946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33320000767707825},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.32249999046325684},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26570001244544983},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.2597000002861023}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2019.8785671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785671","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:arXiv.org:1909.04878","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.04878","pdf_url":"https://arxiv.org/pdf/1909.04878","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1909.04878","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.04878","pdf_url":"https://arxiv.org/pdf/1909.04878","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1534682606","https://openalex.org/W1601269853","https://openalex.org/W1988961015","https://openalex.org/W1999032440","https://openalex.org/W2009379153","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2035932556","https://openalex.org/W2077575555","https://openalex.org/W2102459557","https://openalex.org/W2116407296","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2276690803","https://openalex.org/W2758570758","https://openalex.org/W2776885602","https://openalex.org/W2898776142","https://openalex.org/W2962785950","https://openalex.org/W2963666051","https://openalex.org/W2963768895","https://openalex.org/W4293860921","https://openalex.org/W6720446041","https://openalex.org/W6734174366","https://openalex.org/W6734840209","https://openalex.org/W6753495308"],"related_works":[],"abstract_inverted_index":{"The":[0],"fixed":[1,16],"template":[2,17],"Promise":[3],"Constraint":[4],"Satisfaction":[5],"Problem":[6],"(PCSP)":[7],"is":[8,67],"a":[9,47,74,86],"recently":[10],"proposed":[11],"significant":[12],"generalization":[13],"of":[14,23],"the":[15,30,65],"CSP,":[18,89],"which":[19],"includes":[20],"approximation":[21],"variants":[22],"satisfiability":[24],"and":[25],"graph":[26],"coloring":[27],"problems.":[28],"All":[29],"currently":[31],"known":[32],"tractable":[33,52,87],"(i.e.,":[34],"solvable":[35],"in":[36,46,68],"polynomial":[37],"time)":[38],"PCSPs":[39],"over":[40,59],"finite":[41],"templates":[42],"can":[43],"be":[44,82],"reduced,":[45],"certain":[48],"natural":[49],"way,":[50],"to":[51,85],"CSPs.":[53],"However,":[54],"such":[55],"CSPs":[56],"are":[57],"often":[58],"infinite":[60],"domains.":[61],"We":[62],"show":[63],"that":[64,73],"infinity":[66],"fact":[69],"necessary":[70],"by":[71],"proving":[72],"specific":[75],"finite-domain":[76,88],"PCSP,":[77],"namely":[78],"(1-in-3-SAT,":[79],"Not-All-Equal-3-SAT),":[80],"cannot":[81],"naturally":[83],"reduced":[84],"unless":[90],"P=NP.":[91]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2019-08-13T00:00:00"}