{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:53Z","timestamp":1730280713988,"version":"3.28.0"},"reference-count":27,"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.8785792","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["On the Power of Symmetric Linear Programs"],"prefix":"10.1109","author":[{"given":"Albert","family":"Atserias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuj","family":"Dawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joanna","family":"Ochremiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3178538"},{"key":"ref11","volume":"9","author":"otto","year":"2017","journal-title":"Bounded Variable Logics and Counting A Study in Finite Models"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-47.2.337"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2703"},{"key":"ref15","first-page":"7: 1","article-title":"Definable inapproximability: New challenges for duplicator","author":"atserias","year":"2018","journal-title":"27th EACSL Annual Conference on Computer Science Logic CSL 2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005108"},{"journal-title":"Computational Complexity","year":"2007","author":"papadimitriou","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2728816.2728820","article-title":"The nature and power of fixed-point logic with counting","volume":"2","author":"dawar","year":"2015","journal-title":"ACM SIGLOG News"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9692-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/421173"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2822890"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240118X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3127497"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.53"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"journal-title":"Proofs beliefs and algorithms through the lens of sum-of-squares","year":"2016","author":"barak","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00103-K"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"}],"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\/08785792.pdf?arnumber=8785792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785792","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}