{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:14:36Z","timestamp":1729678476522,"version":"3.28.0"},"reference-count":55,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005087","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-12","source":"Crossref","is-referenced-by-count":4,"title":["The limits of SDP relaxations for general-valued CSPs"],"prefix":"10.1109","author":[{"given":"Johan","family":"Thapper","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"Zivny","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400380079"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-015-0327-2"},{"key":"ref32","article-title":"Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs","volume":"abs 1610 2704","author":"kothari","year":"2016","journal-title":"CoRR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/130945648"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.80"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","article-title":"An explicit exact SDP relaxation for nonlinear 0-1 programs","volume":"2081","author":"lasserre","year":"2001","journal-title":"Proceedings of the 8th Integer Programming and Combinatorial Optimization (IPCO'01) ser Lecture Notes in Computer Science"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-007-2012-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090274"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_69"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2008.10.003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.049"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22015-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref21","article-title":"From Weak to Strong LP Gaps for all CSPs","volume":"abs 1608 497","author":"ghosh","year":"2016","journal-title":"CoRR"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00157-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90132-J"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2974019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536457"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"journal-title":"Approximation Algorithms","year":"2013","author":"vazirani","key":"ref53"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970400"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933604"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2873054"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.45"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536455"},{"key":"ref15","first-page":"139","article-title":"Convex relaxations and integrality gaps","volume":"166","author":"chlamt\u00e1\u00eb","year":"2012","journal-title":"Handbook on Semidefinite Conic and Polynomial Optimization ser International Series in Operations Research &Management Science"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/130906398"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2540090"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005108"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/130915479"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2556646"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/070708093"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1120582.1120584"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3_8"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/16M1079245"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.111"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.74"},{"key":"ref42","first-page":"567","article-title":"Lower bounds on the size of semidefinite programming relaxations","author":"lee","year":"2015","journal-title":"Proceedings of the 47th Symposium on Theory of Computing (STOC'15)"},{"key":"ref41","article-title":"Lower bounds on the size of semidefinite programming relaxations","volume":"abs 1411 6317","author":"lee","year":"2014","journal-title":"CoRR"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-008-2122-9"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2017,6,20]]},"location":"Reykjavik, Iceland","end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005087.pdf?arnumber=8005087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T07:39:28Z","timestamp":1570001968000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005087","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}