{"id":"https://openalex.org/W2048068744","doi":"https://doi.org/10.1145/1806689.1806735","title":"Saving space by algebraization","display_name":"Saving space by algebraization","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2048068744","doi":"https://doi.org/10.1145/1806689.1806735","mag":"2048068744"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806735","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":7.9212,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.98554779,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"321","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.994700014591217,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9911999702453613,"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.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9119268655776978},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6727825999259949},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6370589733123779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5935110449790955},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5747612118721008},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5558847188949585},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5132575035095215},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5105112791061401},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.4717493951320648},{"id":"https://openalex.org/keywords/reciprocal-polynomial","display_name":"Reciprocal polynomial","score":0.46308451890945435},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43180692195892334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3738657832145691},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3571932315826416},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33854126930236816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32543009519577026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26764512062072754},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14170798659324646},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05302479863166809}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9119268655776978},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6727825999259949},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6370589733123779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5935110449790955},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5747612118721008},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5558847188949585},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5132575035095215},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5105112791061401},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.4717493951320648},{"id":"https://openalex.org/C97395012","wikidata":"https://www.wikidata.org/wiki/Q1422356","display_name":"Reciprocal polynomial","level":4,"score":0.46308451890945435},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43180692195892334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3738657832145691},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3571932315826416},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33854126930236816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32543009519577026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26764512062072754},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14170798659324646},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05302479863166809},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1806689.1806735","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.3413","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.3413","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Edaniello/papers/SaveSpace.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W716692","https://openalex.org/W46901556","https://openalex.org/W1593947471","https://openalex.org/W1856875316","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1995997000","https://openalex.org/W1996668544","https://openalex.org/W2001868457","https://openalex.org/W2003753063","https://openalex.org/W2012473793","https://openalex.org/W2018637736","https://openalex.org/W2045326192","https://openalex.org/W2045492613","https://openalex.org/W2057385022","https://openalex.org/W2074359677","https://openalex.org/W2083368929","https://openalex.org/W2107351840","https://openalex.org/W2170835539","https://openalex.org/W2752853835","https://openalex.org/W3145128584","https://openalex.org/W4251051271","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3166857172","https://openalex.org/W3169691842","https://openalex.org/W1701984136","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W2122137596","https://openalex.org/W2031666601","https://openalex.org/W1556368910"],"abstract_inverted_index":{"The":[0,24],"Subset":[1,40],"Sum":[2,41],"and":[3,10,29,42,59,70],"Knapsack":[4,43],"problems":[5,9],"are":[6],"fundamental":[7],"NP-complete":[8],"the":[11,72],"pseudo-polynomial":[12,27,57,74],"time":[13,28,37,58],"dynamic":[14],"programming":[15],"algorithms":[16,22,25,38,78],"for":[17,39,79],"them":[18],"appear":[19],"in":[20,56],"every":[21],"textbook.":[23],"require":[26],"space.":[30,61],"Since":[31],"we":[32,65],"do":[33],"not":[34],"expect":[35],"polynomial":[36,60,76],"to":[44],"exist,":[45],"a":[46],"very":[47],"natural":[48],"question":[49,68],"is":[50],"whether":[51],"they":[52],"can":[53],"be":[54],"solved":[55],"In":[62],"this":[63,67],"paper":[64],"answer":[66],"affirmatively,":[69],"give":[71],"first":[73],"time,":[75],"space":[77],"these":[80],"problems.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":9}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}