{"id":"https://openalex.org/W2626471773","doi":"https://doi.org/10.1145/3055399.3055467","title":"Faster space-efficient algorithms for subset sum and k-sum","display_name":"Faster space-efficient algorithms for subset sum and k-sum","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2626471773","doi":"https://doi.org/10.1145/3055399.3055467","mag":"2626471773"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055467","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","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/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Shashwat Garg","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","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/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","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/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nikhil Vyas","raw_affiliation_strings":["IIT Bombay, India"],"affiliations":[{"raw_affiliation_string":"IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":1.6592,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85501815,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"198","last_page":"209"},"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.9998000264167786,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8673344850540161},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.6681604385375977},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.58660888671875},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.5859186053276062},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5537869334220886},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5229933261871338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5225086808204651},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5214192867279053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5209866166114807},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5005662441253662},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.49385887384414673},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46313241124153137},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44839537143707275},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4464339017868042},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.44300520420074463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3513067364692688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3508126735687256},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09967148303985596},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.066535085439682}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8673344850540161},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.6681604385375977},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.58660888671875},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.5859186053276062},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5537869334220886},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5229933261871338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5225086808204651},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5214192867279053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5209866166114807},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5005662441253662},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.49385887384414673},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46313241124153137},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44839537143707275},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4464339017868042},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.44300520420074463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3513067364692688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3508126735687256},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09967148303985596},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.066535085439682},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3055399.3055467","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/679c11ac-860d-46fa-90a5-d824c439bef4","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/679c11ac-860d-46fa-90a5-d824c439bef4","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Garg, S, Nederlof, J & Vyas, N 2017, Faster space-efficient algorithms for subset sum and k-sum. in P McKenzie, V King & H Hatami (eds), Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., New York, pp. 198-209, 49th Annual ACM SIGACT Symposium on Theory of Computing, Canada, 19/06/17. https://doi.org/10.1145/3055399.3055467","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:875744","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=875744","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:871433","is_oa":false,"landing_page_url":"http://repository.tue.nl/871433","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:875744","is_oa":false,"landing_page_url":"http://repository.tue.nl/875744","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/679c11ac-860d-46fa-90a5-d824c439bef4","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/679c11ac-860d-46fa-90a5-d824c439bef4","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 198 - 209","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1149905983","display_name":null,"funder_award_id":"022.005.025,639.021.438, and 639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G628422989","display_name":null,"funder_award_id":"617951","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W41804080","https://openalex.org/W1480447816","https://openalex.org/W1489218628","https://openalex.org/W1527197079","https://openalex.org/W1745272466","https://openalex.org/W1790769202","https://openalex.org/W1847405718","https://openalex.org/W1856875316","https://openalex.org/W1868947940","https://openalex.org/W1882041575","https://openalex.org/W1968182591","https://openalex.org/W1973794389","https://openalex.org/W1981030589","https://openalex.org/W1984481156","https://openalex.org/W2008272678","https://openalex.org/W2012948111","https://openalex.org/W2015963099","https://openalex.org/W2026339776","https://openalex.org/W2045492613","https://openalex.org/W2048068744","https://openalex.org/W2066945620","https://openalex.org/W2074196013","https://openalex.org/W2109797885","https://openalex.org/W2137384791","https://openalex.org/W2150780437","https://openalex.org/W2158896582","https://openalex.org/W2159641801","https://openalex.org/W2162674806","https://openalex.org/W2198078872","https://openalex.org/W2252401345","https://openalex.org/W2346812038","https://openalex.org/W2400482671","https://openalex.org/W2540137001","https://openalex.org/W2611754984","https://openalex.org/W2949604493","https://openalex.org/W4298201387","https://openalex.org/W6713676679"],"related_works":["https://openalex.org/W1520614092","https://openalex.org/W2922506098","https://openalex.org/W2389156036","https://openalex.org/W2922514085","https://openalex.org/W1990489976","https://openalex.org/W4377227120","https://openalex.org/W2060547385","https://openalex.org/W1546205275","https://openalex.org/W2049594334","https://openalex.org/W1572789216"],"abstract_inverted_index":{"We":[0,61],"present":[1],"randomized":[2],"algorithms":[3],"that":[4,64],"solve":[5,46],"Subset":[6],"Sum":[7],"and":[8,28,80],"Knapsack":[9],"instances":[10,71],"with":[11,53],"n":[12,51],"items":[13],"in":[14,24,56],"O*(20.86n)":[15],"time,":[16],"where":[17],"the":[18,25,84],"O*(\u00b7)":[19],"notation":[20],"suppresses":[21],"factors":[22],"polynomial":[23,29],"input":[26],"size,":[27],"space,":[30,82],"assuming":[31],"random":[32,38,70,87,90],"read-only":[33],"access":[34,88],"to":[35,45,89],"exponentially":[36],"many":[37],"bits.":[39,91],"These":[40],"results":[41],"can":[42,74],"be":[43,75],"extended":[44],"Binary":[47],"Linear":[48],"Programming":[49],"on":[50],"variables":[52],"few":[54],"constraints":[55],"a":[57],"similar":[58],"running":[59],"time.":[60],"also":[62],"show":[63],"for":[65],"any":[66],"constant":[67],"k\u2265":[68],"2,":[69],"of":[72,86],"k-Sum":[73],"solved":[76],"using":[77],"O(nk-0.5(n))":[78],"time":[79],"O(logn)":[81],"without":[83],"assumption":[85]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}