{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:05Z","timestamp":1750220045010,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>\n            This quarter's\n            <jats:italic>Complexity<\/jats:italic>\n            column is devoted to the\n            <jats:italic>Promise Constraint Satisfaction Problem (PCSP).<\/jats:italic>\n            This framework was introduced relatively recently by Austrin, Guruswami and H\u00e5stad as a generalization of the\n            <jats:italic>Constraint Satisfaction Problem<\/jats:italic>\n            (\n            <jats:italic>CSP<\/jats:italic>\n            ) that has received quite a bit of attention in the last three decades. Although the CSP captures many naturally occurring algorithmic problems and the CSP research has been very successful with the majority of research questions settled, there are still some important problems it does not capture. The PCSP was designed to fix that.\n          <\/jats:p>","DOI":"10.1145\/3559736.3559739","type":"journal-article","created":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T22:32:53Z","timestamp":1661466773000},"page":"29-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity column"],"prefix":"10.1145","volume":"9","author":[{"given":"Andrei","family":"Bulatov","sequence":"first","affiliation":[{"name":"Simon Fraser University"}]}],"member":"320","published-online":{"date-parts":[[2022,8,25]]},"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559736.3559739","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:57Z","timestamp":1750183677000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559736.3559739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3559736.3559739"],"URL":"https:\/\/doi.org\/10.1145\/3559736.3559739","relation":{},"ISSN":["2372-3491"],"issn-type":[{"type":"electronic","value":"2372-3491"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"2022-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}