{"id":"https://openalex.org/W2564022051","doi":"https://doi.org/10.1137/17m1158203","title":"Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems","display_name":"Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2564022051","doi":"https://doi.org/10.1137/17m1158203","mag":"2564022051"},"language":"en","primary_location":{"id":"doi:10.1137/17m1158203","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1158203","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["CWI, 1098 XG Amsterdam, Netherlands","\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI, 1098 XG Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114033528","display_name":"Shashwat Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Shashwat Garg","raw_affiliation_strings":["CWI, 1098 XG Amsterdam, Netherlands","\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI, 1098 XG Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","CWI, 1098 XG Amsterdam, Netherlands","\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"CWI, 1098 XG Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102775428","display_name":"Nikhil Vyas","orcid":"https://orcid.org/0000-0002-4055-7693"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Nikhil Vyas","raw_affiliation_strings":["\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and","\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","CWI, 1098 XG Amsterdam, Netherlands","\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands, and","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"\\ddagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 AB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"CWI, 1098 XG Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"\\S Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I63966007","https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":2.1493,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.88508897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"47","issue":"5","first_page":"1755","last_page":"1777"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7292912602424622},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6966692209243774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6615347862243652},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5690454840660095},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5364423990249634},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5273231863975525},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5238114595413208},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5047508478164673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5008254051208496},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4885428845882416},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.45965924859046936},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.43977272510528564},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42703408002853394},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.41962727904319763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32565879821777344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14485567808151245},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09145882725715637}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7292912602424622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6966692209243774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6615347862243652},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5690454840660095},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5364423990249634},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5273231863975525},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5238114595413208},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5047508478164673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5008254051208496},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4885428845882416},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.45965924859046936},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.43977272510528564},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42703408002853394},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.41962727904319763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32565879821777344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14485567808151245},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09145882725715637},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/17m1158203","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1158203","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Garg, S, Nederlof, J & Vyas, N 2018, 'Faster space-efficient algorithms for subset sum, k -sum, and related problems', SIAM Journal on Computing, vol. 47, no. 5, pp. 1755-1777. https://doi.org/10.1137/17M1158203","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cwi.nl:28112","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/28112","pdf_url":"https://ir.cwi.nl/pub/28112/28112.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing vol. 47 no. 5, pp. 1755-1777","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.tue.nl:publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85056144635&partnerID=8YFLogxK","pdf_url":"https://pure.tue.nl/ws/files/111514637/17m1158203.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bansal, N, Garg, S, Nederlof, J & Vyas, N 2018, 'Faster space-efficient algorithms for subset sum, k -sum, and related problems', SIAM Journal on Computing, vol. 47, no. 5, pp. 1755-1777. https://doi.org/10.1137/17M1158203","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","pdf_url":"https://research.tue.nl/nl/publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 47(5), 1755 - 1777. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/2ba1b4d7-1192-4a44-989f-9db82afacb46","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Garg, S, Nederlof, J & Vyas, N 2018, 'Faster space-efficient algorithms for subset sum, k -sum, and related problems', SIAM Journal on Computing, vol. 47, no. 5, pp. 1755-1777. https://doi.org/10.1137/17M1158203","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G2275010174","display_name":null,"funder_award_id":"639.021.438","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6130719263","display_name":null,"funder_award_id":"617951","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G7157536220","display_name":null,"funder_award_id":"022.005.025","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W258748880","https://openalex.org/W1968182591","https://openalex.org/W1971483538","https://openalex.org/W1981030589","https://openalex.org/W1984481156","https://openalex.org/W2008272678","https://openalex.org/W2045492613","https://openalex.org/W2080745194","https://openalex.org/W2137384791","https://openalex.org/W2150780437","https://openalex.org/W2597941492","https://openalex.org/W2611754984","https://openalex.org/W4251436657"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W1994598067","https://openalex.org/W2055932080","https://openalex.org/W3097369619","https://openalex.org/W2565109825"],"abstract_inverted_index":{"We":[0,61],"present":[1],"randomized":[2],"algorithms":[3],"that":[4,64,99,129],"solve":[5,46],"subset":[6],"sum":[7],"and":[8,28,80],"knapsack":[9],"instances":[10,71],"with":[11,53,108],"$n$":[12,51,107,115],"items":[13],"in":[14,24,56,114,153],"$O^*(2^{0.86n})$":[15],"time,":[16],"where":[17],"the":[18,25,85,142,154],"$O^*(\\cdot)$":[19],"notation":[20],"suppresses":[21],"factors":[22],"polynomial":[23,29,113],"input":[26],"size,":[27],"space,":[30,83],"assuming":[31],"random":[32,38,70,88,91,121,125],"read-only":[33,122],"access":[34,89,123],"to":[35,45,90,124],"exponentially":[36],"many":[37],"bits.":[39,92],"These":[40],"results":[41,95],"can":[42,74,132],"be":[43,75,133],"extended":[44],"binary":[47],"integer":[48],"programming":[49],"on":[50],"variables":[52],"few":[54],"constraints":[55],"a":[57,112,117],"similar":[58],"running":[59],"time.":[60],"also":[62],"show":[63,128],"for":[65],"any":[66],"constant":[67],"$k\\geq":[68],"2$,":[69],"of":[72,87,105],"$k$-sum":[73],"solved":[76,134],"using":[77,135],"$O(n^{k-0.5}\\mathrm{polylog}(n))$":[78],"time":[79,145],"$O(\\log":[81,136],"n)$":[82,137],"without":[84],"assumption":[86],"Underlying":[93],"these":[94],"is":[96],"an":[97],"algorithm":[98,146],"determines":[100],"whether":[101],"two":[102],"given":[103],"lists":[104],"length":[106],"integers":[109],"bounded":[110],"by":[111],"share":[116],"common":[118],"value.":[119],"Assuming":[120],"bits,":[126],"we":[127],"this":[130],"problem":[131],"space":[138],"significantly":[139],"faster":[140],"than":[141],"trivial":[143],"$O(n^2)$":[144],"if":[147],"no":[148],"value":[149],"occurs":[150],"too":[151],"often":[152],"same":[155],"list.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-10T08:33:47.465468","created_date":"2025-10-10T00:00:00"}