{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:56:52Z","timestamp":1781078212249,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806735","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"321-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Saving space by algebraization"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[{"name":"University of Bergen, Bergen, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[{"name":"University of Bergen, Bergen, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.39.9.947"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321111"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250801"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/070683933"},{"key":"e_1_3_2_1_5_1","unstructured":"P. J. Cameron. Combinatorics. Cambridge University Press 1998.  P. J. Cameron. Combinatorics. Cambridge University Press 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2736-4_63"},{"key":"e_1_3_2_1_7_1","unstructured":"T. Cormen C. Leiserson R. Rivest and C. Stein. Introduction to algorithms 2001.   T. Cormen C. Leiserson R. Rivest and C. Stein. Introduction to algorithms 2001."},{"key":"e_1_3_2_1_8_1","volume-title":"McGraw-Hill","author":"Dasgupta S.","year":"2006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-1324-4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250800"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216034"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321823"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"N. Howgrave-Graham and A. Joux. A new generic algorithm for hard knapsacks (to appear in eurocrypt 2010).  N. Howgrave-Graham and A. Joux. A new generic algorithm for hard knapsacks (to appear in eurocrypt 2010).","DOI":"10.1007\/978-3-642-13190-5_12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(82)90044-X"},{"key":"e_1_3_2_1_17_1","unstructured":"D. E. Knuth. The Art of Computer Programming Volume II: Seminumerical Algorithms. Addison-Wesley 1969.  D. E. Knuth. The Art of Computer Programming Volume II: Seminumerical Algorithms. Addison-Wesley 1969."},{"key":"e_1_3_2_1_18_1","unstructured":"M. Koivisto and P. Parviainen. A Space-Time Tradeoff for Permutation Problems.  M. Koivisto and P. Parviainen. A Space-Time Tradeoff for Permutation Problems."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_59"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_21_1","first-page":"281","volume-title":"IWPEC","author":"Woeginger G. J.","year":"2004"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"G. J.\n       \n      Woeginger\n    .\n      \n  \n   \n  Space and time complexity of exact algorithms: Some open problems (invited talk). In R. G. Downey M. R. Fellows and F. K. H. A. Dehne editors IWPEC volume \n  3162\n   of \n  Lecture Notes in Computer Science pages \n  281\n  --\n  290\n  . \n  Springer 2004\n  .  G. J. Woeginger. Space and time complexity of exact algorithms: Some open problems (invited talk). In R. G. Downey M. R. Fellows and F. K. H. A. Dehne editors IWPEC volume 3162 of Lecture Notes in Computer Science pages 281--290. Springer 2004.","DOI":"10.1007\/978-3-540-28639-4_25"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":22,"alternative-id":["10.1145\/1806689.1806735","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806735","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}