{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:42:34Z","timestamp":1772044954351,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249986","type":"print"},{"value":"9783540318569","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_25","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"305-314","source":"Crossref","is-referenced-by-count":13,"title":["Solving Medium-Density Subset Sum Problems in Expected Polynomial Time"],"prefix":"10.1007","author":[{"given":"Abraham D.","family":"Flaxman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Przydatek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM\u00a050(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"key":"25_CR2","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"113","volume-title":"Combinatorics","author":"B. Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B.: Martingales, isoperimetric inequalities and random graphs. In: Hajnal, A., Lov\u00e1sz, L., S\u00f3s, V.T. (eds.) Combinatorics. Colloq. Math. Soc. J\u00e1nos Bolyai, vol.\u00a052, pp. 113\u2013139. North Holland, Amsterdam (1988)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: Random knapsack in expected polynomial time. In: Proc. 35th ACM STOC, pp. 232\u2013241 (2003)","DOI":"10.1145\/780542.780578"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0885-064X(89)90025-3","volume":"5","author":"M. Chaimovich","year":"1989","unstructured":"Chaimovich, M., Freiman, G., Galil, Z.: Solving dense subset-sum problems by using analytical number theory. J. Complex.\u00a05(3), 271\u2013282 (1989)","journal-title":"J. Complex."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","volume":"28","author":"V. Chvatal","year":"1980","unstructured":"Chvatal, V.: Hard knapsack problems. Operations Research\u00a028, 1402\u20131411 (1980)","journal-title":"Operations Research"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complex.\u00a02(2), 111\u2013128 (1992)","journal-title":"Comput. Complex."},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/0215038","volume":"15","author":"A. Frieze","year":"1986","unstructured":"Frieze, A.: On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM J. Comput.\u00a015(2), 536\u2013539 (1986)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/0220072","volume":"20","author":"Z. Galil","year":"1991","unstructured":"Galil, Z., Margalit, O.: An almost linear-time algorithm for the dense subset-sum problem. SIAM J. Comput.\u00a020(6), 1157\u20131189 (1991)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology\u00a09(4), 199\u2013216 (Fall 1996)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM\u00a032(1), 229\u2013246 (1985)","journal-title":"J. ACM"},{"key":"25_CR11","series-title":"London Mathematical Society Lecture Note Series","first-page":"148","volume-title":"On the method of bounded differences","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. London Mathematical Society Lecture Note Series, vol.\u00a0141, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:30:40Z","timestamp":1558287040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}