{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:05:47Z","timestamp":1775729147270,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF","award":["CMMI-1300144"],"award-info":[{"award-number":["CMMI-1300144"]}]},{"name":"NSF","award":["CCF-1415496"],"award-info":[{"award-number":["CCF-1415496"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/tit.2015.2465864","type":"journal-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T16:19:17Z","timestamp":1439482757000},"page":"5754-5764","source":"Crossref","is-referenced-by-count":7,"title":["The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes"],"prefix":"10.1109","volume":"61","author":[{"given":"Gabor","family":"Braun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-010-0122-z"},{"key":"ref32","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"ref30","article-title":"Information-theoretic approximations of the nonnegative rank","author":"braun","year":"2013","journal-title":"Electron Colloq Comput Complex"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/12.1.313"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"ref34","first-page":"2","article-title":"Extended formulations in combinatorial optimization","volume":"85","author":"kaibel","year":"2011","journal-title":"OPTIMA"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9421-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.10"},{"key":"ref12","first-page":"161","article-title":"An information complexity approach to extended formulations","volume":"12","author":"braverman","year":"2012","journal-title":"Proc 45th Annu ACM Symp Theory Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"ref14","article-title":"Average case polyhedral complexity of the maximum stable set problem","author":"braun","year":"2013"},{"key":"ref15","first-page":"567","article-title":"Lower bounds on the size of semidefinite programming relaxations","author":"lee","year":"2015","journal-title":"Proc 47th Annu ACM STOC"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.03.010"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.09.003"},{"key":"ref19","article-title":"Exponential lower bounds on the size of approximate formulations in the natural encoding for capacitated facility location","author":"kolliopoulos","year":"2013"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2258372"},{"key":"ref4","first-page":"223","article-title":"Expressing combinatorial optimization problems by linear programs (extended abstract)","author":"yannakakis","year":"1988","journal-title":"Proceedings of the 20th Annual STOC"},{"key":"ref27","first-page":"151","article-title":"From information to exact communication","author":"braverman","year":"2012","journal-title":"Proc 45th Annu ACM Symp Theory Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.79"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213988"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192238482"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10107-012-0574-3","article-title":"Some 0\/1 polytopes need exponential size extended formulations","volume":"142","author":"rothvo\u00df","year":"2012","journal-title":"Math Program"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_11"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_19"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/2591796.2591834","article-title":"The matching polytope has exponential extension complexity","author":"rothvo\u00df","year":"2014","journal-title":"Proc 46th Annu ACM STOC"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.45"},{"key":"ref22","article-title":"Extended formulations for combinatorial polytopes","author":"pashkovich","year":"2012"},{"key":"ref21","article-title":"LP and SDP inapproximability of combinatorial problems","author":"braun","year":"2014"},{"key":"ref24","article-title":"Combinatorial bounds on nonnegative rank and extended formulations","author":"fiorini","year":"2012"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32147-4_13"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"ref25","article-title":"A short proof that the extension complexity of the correlation polytope grows exponentially","author":"kaibel","year":"2013"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7258415\/07182355.pdf?arnumber=7182355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:46:31Z","timestamp":1642005991000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7182355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":36,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2465864","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}