{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:32Z","timestamp":1750694732622},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_21","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"254-266","source":"Crossref","is-referenced-by-count":2,"title":["Number Balancing is as Hard as Minkowski\u2019s Theorem and Shortest Vector"],"prefix":"10.1007","author":[{"given":"Rebecca","family":"Hoberg","sequence":"first","affiliation":[]},{"given":"Harishchandra","family":"Ramadas","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Rothvoss","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the 28th STOC, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"issue":"5","key":"21_CR2","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D Aharonov","year":"2005","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP cap conp. J. ACM 52(5), 749\u2013765 (2005)","journal-title":"J. ACM"},{"issue":"12","key":"21_CR3","doi-asserted-by":"crossref","first-page":"3627","DOI":"10.1090\/S0002-9939-96-03653-2","volume":"124","author":"T Bohman","year":"1996","unstructured":"Bohman, T.: A sum packing problem of erd\u00f6s and the conway-guy sequence. Proc. AMS 124(12), 3627\u20133636 (1996)","journal-title":"Proc. AMS"},{"key":"21_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1997","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1997)"},{"key":"21_CR5","first-page":"122","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"2012","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, vol. 2, pp. 122\u2013125. Springer, Heidelberg (2012)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Haviv, I., Regev, O.: Tensor-based hardness of the shortest vector problem to within almost polynomial factors, pp. 469\u2013477 (2007)","DOI":"10.1145\/1250790.1250859"},{"key":"21_CR7","unstructured":"John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays Presented to R. Courant on his 60th Birthday, 8 January 1948, pp. 187\u2013204. Interscience Publishers Inc., New York (1948)"},{"key":"21_CR8","unstructured":"Karmarkar, N., Karp, R.: The differencing method of set partitioning. Technical report, CS Division, UC Berkeley (1982). http:\/\/digitalassets.lib.berkeley.edu\/techreports\/ucb\/text\/CSD-83-113.pdf"},{"key":"21_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"issue":"4","key":"21_CR10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: An Algorithmic Theory of Numbers, Graphs and Convexity. SIAM (1986)","DOI":"10.1137\/1.9781611970203"},{"key":"21_CR12","unstructured":"Lov\u00e1sz, L.: Geometric Algorithms and Algorithmic Geometry. American Mathematical Society (1990)"},{"issue":"181","key":"21_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1988-0917837-5","volume":"50","author":"W Lunnon","year":"1988","unstructured":"Lunnon, W.: Integer sets with distinct subset-sums. Math. Comput. 50(181), 297\u2013320 (1988)","journal-title":"Math. Comput."},{"issue":"1","key":"21_CR14","doi-asserted-by":"crossref","first-page":"P117","DOI":"10.37236\/604","volume":"18","author":"V Lev","year":"2011","unstructured":"Lev, V., Yuster, R.: On the size of dissociated bases. Electr. J. Comb. 18(1), P117 (2011)","journal-title":"Electr. J. Comb."},{"key":"21_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matousek","year":"2002","unstructured":"Matousek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"issue":"2","key":"21_CR16","first-page":"125","volume":"125","author":"S Mertens","year":"2006","unstructured":"Mertens, S.: The easiest hard problem: number partitioning. Comput. Complex. Stat. Phys. 125(2), 125\u2013139 (2006)","journal-title":"Comput. Complex. Stat. Phys."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post-quantum Cryptography, pp. 147\u2013191. Springer (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"21_CR18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley Inc., New York (1990)"},{"key":"21_CR19","volume-title":"Information Security and Cryptography","author":"P Nguyen","year":"2010","unstructured":"Nguyen, P., Vall\u00e9e, B.: The lll algorithm. In: Nguyen, P., Vall\u00e9e, B. (eds.) Information Security and Cryptography. Springer, Heidelberg (2010)"},{"issue":"3","key":"21_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C Schnorr","year":"1987","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"21_CR22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0020-0190(92)90226-L","volume":"42","author":"G Woeginger","year":"1992","unstructured":"Woeginger, G., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42(6), 299\u2013302 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T04:46:28Z","timestamp":1602132388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}