{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:41:53Z","timestamp":1729651313189,"version":"3.28.0"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/allerton.2015.7447134","type":"proceedings-article","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T16:58:11Z","timestamp":1461171491000},"page":"1119-1126","source":"Crossref","is-referenced-by-count":0,"title":["Information theory and polyhedral combinatorics"],"prefix":"10.1109","author":[{"given":"Sebastian","family":"Pokutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536455"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9655-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702407345"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb03624.x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0574-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2258372"},{"key":"ref37","article-title":"Information-theoretic approximations of the nonnegative rank","author":"braun","year":"2013","journal-title":"ECC"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192238482"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.86"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref40","article-title":"Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon","author":"bazzi","year":"2015","journal-title":"Proceedings of FOCS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0131026"},{"key":"ref12","article-title":"An information complexity approach to extended formulations","volume":"19","author":"braverman","year":"2012","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.79"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.57"},{"journal-title":"Theory of Linear and Integer Programming","year":"1986","author":"schrijver","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90028-N"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.2.193.10561"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20807-2_23"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9421-9"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2716307"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0575"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213988"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.45"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"ref5","article-title":"The matching polytope has exponential extension complexity","author":"rothvo\u00df","year":"2015","journal-title":"Proc STOC"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1145\/2746539.2746599","article-title":"Lower bounds on the size of semidefinite programming formulations","author":"lee","year":"2015","journal-title":"Proceedings of STOC"},{"key":"ref2","first-page":"223","article-title":"Expressing combinatorial optimization problems by linear programs (extended abstract)","author":"yannakakis","year":"1988","journal-title":"Proc STOC 1988"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.53"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746550"},{"journal-title":"Non-additivity of the entanglement of purification (beyond reasonable doubt)","year":"2012","author":"chen","key":"ref45"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.10"},{"key":"ref47","article-title":"A new, fully quantum notion of information complexity, and an application to direct sum for bounded round quantum communication complexity","author":"touchette","year":"2015","journal-title":"STOC"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0663-7"},{"key":"ref42","article-title":"On the existence of 0\/1 polytopes with high semidefinite extension complexity","author":"bri\u00e9t","year":"2014","journal-title":"Mathematical Programming B"},{"journal-title":"Extended Formulations for Combinatorial Polytopes","year":"2012","author":"pashkovich","key":"ref24"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_19"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.10"},{"article-title":"CS 766\/QIC 820 Theory of Quantum Information","year":"2011","author":"watrous","key":"ref44"},{"key":"ref26","first-page":"2","article-title":"Extended formulations in combinatorial optimization","volume":"85","author":"kaibel","year":"2011","journal-title":"OPTIMA"},{"article-title":"The matching problem has no small symmetric SDP","year":"2015","author":"braun","key":"ref43"},{"journal-title":"Extended Formulations in Combinatorial Optimization","year":"2010","author":"conforti","key":"ref25"}],"event":{"name":"2015 53rd Annual Allerton Conference on Communication, Control and Computing (Allerton)","start":{"date-parts":[[2015,9,29]]},"location":"Monticello, IL","end":{"date-parts":[[2015,10,2]]}},"container-title":["2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7444067\/7446973\/07447134.pdf?arnumber=7447134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T07:25:18Z","timestamp":1498289118000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7447134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/allerton.2015.7447134","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}