{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T23:56:03Z","timestamp":1785974163557,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250801","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"67-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":149,"title":["Fourier meets m\u00f6bius: fast subset convolution"],"prefix":"10.1145","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[{"name":"Lund University, Lund, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[{"name":"Lund University, Lund, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6666-3","volume-title":"Combinatorial Theory","author":"Aigner M.","year":"1979","unstructured":"M. Aigner , Combinatorial Theory , Springer , Berlin , 1979 . M. Aigner, Combinatorial Theory, Springer, Berlin, 1979."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.41"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_58"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-1324-4"},{"key":"e_1_3_2_1_8_1","unstructured":"B. Fuchs W. Kern X. Wang Speeding up the Dreyfus--Wagner algorithm for minimum Steiner trees Math. Meth. Oper. Res. to appear.  B. Fuchs W. Kern X. Wang Speeding up the Dreyfus--Wagner algorithm for minimum Steiner trees Math. Meth. Oper. Res. to appear."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250800"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1385"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00089-4"},{"key":"e_1_3_2_1_12_1","volume-title":"Computers and Intractability---A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey , D. Johnson , Computers and Intractability---A Guide to the Theory of NP-Completeness , W.H. Freeman & Co. , San Francisco, CA , 1979 . M. Garey, D. Johnson, Computers and Intractability---A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., San Francisco, CA, 1979."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.148425"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.11"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1090\/dimacs\/028\/13","volume-title":"Groups and Computation, II","author":"Maslen D.K.","year":"1997","unstructured":"D.K. Maslen , D.N. Rockmore , Generalized FFTs---a survey of some recent results , in: L. Finkelstein, W.M. Kantor (Eds.), Groups and Computation, II , American Mathematical Society , Providence, RI , 1997 , pp. 183 -- 237 . D.K. Maslen, D.N. Rockmore, Generalized FFTs---a survey of some recent results, in: L. Finkelstein, W.M. Kantor (Eds.), Groups and Computation, II, American Mathematical Society, Providence, RI, 1997, pp. 183--237."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_46"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00185-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531932"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.133"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1078"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. 40th Symposium on Foundations of Computer Science","author":"Shoshan A.","year":"1999","unstructured":"A. Shoshan , U. Zwick, All pairs shortest paths in undirected graphs with integer weights , in: Proc. 40th Symposium on Foundations of Computer Science ( New York, Oct. 17--19 , 1999 ), IEEE Computer Society, Los Alamitos, CA, 1999, pp. 605--614. A. Shoshan, U. Zwick, All pairs shortest paths in undirected graphs with integer weights, in: Proc. 40th Symposium on Foundations of Computer Science (New York, Oct. 17--19, 1999), IEEE Computer Society, Los Alamitos, CA, 1999, pp. 605--614."},{"key":"e_1_3_2_1_25_1","volume-title":"Cambridge University Press","author":"Stanley R.P.","year":"1997","unstructured":"R.P. Stanley , Enumerative Combinatorics , Vol I , Cambridge University Press , Cambridge , 1997 . R.P. Stanley, Enumerative Combinatorics, Vol I, Cambridge University Press, Cambridge, 1997."},{"key":"e_1_3_2_1_27_1","volume-title":"Technical Communication No. 35","author":"Yates F.","year":"1937","unstructured":"F. Yates , The Design and Analysis of Factorial Experiments , Technical Communication No. 35 , Commonwealth Bureau of Soil Science , Harpenden, UK , 1937 . F. Yates, The Design and Analysis of Factorial Experiments, Technical Communication No. 35, Commonwealth Bureau of Soil Science, Harpenden, UK, 1937."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90085-5"}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":27,"alternative-id":["10.1145\/1250790.1250801","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250801","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}