{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T17:15:54Z","timestamp":1721322954259},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T00:00:00Z","timestamp":1323129600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00224-011-9373-0","type":"journal-article","created":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T10:05:50Z","timestamp":1323079550000},"page":"50-64","source":"Crossref","is-referenced-by-count":1,"title":["Cutting Planes and the Parameter Cutwidth"],"prefix":"10.1007","volume":"51","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,6]]},"reference":[{"issue":"3","key":"9373_CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.jcss.2007.06.025","volume":"74","author":"A. Atserias","year":"2008","unstructured":"Atserias, A., Dalmau, V.: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3), 323\u2013334 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"9373_CR2","unstructured":"Ben-sasson, E., Wigderson, A.: Short proofs are narrow\u2014resolution made simple. J. Assoc. Comp. Mach. (1999), pp. 517\u2013526"},{"issue":"1\u20132","key":"9373_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00156-0","volume":"98","author":"A. Bockmayr","year":"1999","unstructured":"Bockmayr, A., Eisenbrand, F., Hartmann, M., Schulz, A.S.: On the Chv\u00e1tal rank of polytopes in the 0\/1 cube. Discrete Appl. Math. 98(1\u20132), 21\u201327 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9373_CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.4086\/toc.2006.v002a004","volume":"2","author":"J. Buresh-Oppenheim","year":"2006","unstructured":"Buresh-Oppenheim, J., Galesi, N., Hoory, S., Magen, A., Pitassi, T.: Rank bounds and integrality gaps for cutting planes procedures. Theory Comput. 2(4), 65\u201390 (2006)","journal-title":"Theory Comput."},{"key":"9373_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"issue":"1","key":"9373_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W. Cook","year":"1987","unstructured":"Cook, W., Coullard, C.R., Tur\u00e1n, G.: On the complexity of cutting-plane proofs. Discrete Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"key":"9373_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/1250790.1250837","volume-title":"STOC \u201907: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","author":"S.S. Dantchev","year":"2007","unstructured":"Dantchev, S.S.: Rank complexity gap for Lov\u00e1sz-Schrijver and Sherali-Adams proof systems. In: STOC \u201907: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, New York, NY, USA, pp. 311\u2013317. ACM, New York (2007)"},{"key":"9373_CR8","series-title":"LNCS","first-page":"134","volume-title":"5th Conference on Computability in Europe","author":"S.S. Dantchev","year":"2009","unstructured":"Dantchev, S.S., Martin, B.: Cutting planes and the parameter cutwidth. In: 5th Conference on Computability in Europe. LNCS, vol. 5635, pp. 134\u2013143 (2009)"},{"issue":"2","key":"9373_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00493-003-0020-5","volume":"23","author":"F. Eisenbrand","year":"2003","unstructured":"Eisenbrand, F., Schulz, S.: Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1-cube. Combinatorica 23(2), 245\u2013261 (2003)","journal-title":"Combinatorica"},{"key":"9373_CR10","volume-title":"Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics","author":"R.E. Gomory","year":"1960","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman, R., Hall, M. (eds.) Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics, Providence, RI, vol.\u00a010 (1960)"},{"key":"9373_CR11","first-page":"269","volume-title":"Recent advances in mathematical programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Recent advances in mathematical programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"issue":"3","key":"9373_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00037-001-8194-y","volume":"10","author":"S. Riis","year":"2001","unstructured":"Riis, S.: A complexity gap for tree resolution. Comput. Complex. 10(3), 179\u2013209 (2001)","journal-title":"Comput. Complex."},{"key":"9373_CR13","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/LICS.2008.30","volume-title":"Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008)","author":"S. Riis","year":"2008","unstructured":"Riis, S.: On the asymptotic nullstellensatz and polynomial calculus proof complexity. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pp. 272\u2013283. IEEE Comput. Soc. Press, New York (2008)"},{"issue":"3","key":"9373_CR14","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9373-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9373-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9373-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,18]],"date-time":"2021-12-18T18:08:42Z","timestamp":1639850922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9373-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,6]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9373"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9373-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,6]]}}}