{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:11:50Z","timestamp":1760080310073,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785671","type":"proceedings-article","created":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T21:15:55Z","timestamp":1565039755000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Promises Make Finite (Constraint Satisfaction) Problems Infinitary"],"prefix":"10.1109","author":[{"given":"Libor","family":"Barto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.38"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00230-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-017-1621-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(1:7)2012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/15M1006507"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90132-J"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-540-70583-3_16","article-title":"Non-dichotomies in constraint satisfaction complexity","author":"bodirsky","year":"2008","journal-title":"Automata Languages and Programming"},{"key":"ref4","article-title":"Algebraic approach to promise constraint satisfaction","volume":"abs 1811 970","author":"bul\u00edn","year":"2018","journal-title":"CoRR"},{"key":"ref3","first-page":"14:1","article-title":"New hardness results for graph and hypergraph colorings","author":"brakensiek","year":"2016","journal-title":"Proceedings of the 31st Conference on Computational Complexity ser CCC '16"},{"key":"ref6","article-title":"An algorithmic blend of LPs and ring equations for promise CSPs","volume":"abs 1807 5194","author":"brakensiek","year":"2018","journal-title":"CoRR"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1137\/1.9781611975031.117","article-title":"Promise constraint satisfaction: structure theory and a symmetric boolean dichotomy","author":"brakensiek","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref8","first-page":"1","article-title":"Polymorphisms, and How to Use Them","volume":"7","author":"barto","year":"2017","journal-title":"On the Complexity of Constraint Satisfaction Problems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.37"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3_8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934544"},{"journal-title":"Algebraic and model theoretic methods in constraint satisfaction","year":"2015","author":"pinsker","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-010-0082-3"},{"key":"ref23","first-page":"79","article-title":"Constraint Satisfaction Problems over Numeric Domains","volume":"7","author":"bodirsky","year":"2017","journal-title":"On the Complexity of Constraint Satisfaction Problems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-008-2122-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-014-0289-9"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785671.pdf?arnumber=8785671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:20:37Z","timestamp":1658247637000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785671\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785671","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}