{"id":"https://openalex.org/W7214283205","doi":"https://doi.org/10.1016/j.procs.2026.08.473","title":"Polynomial methods for solving the subset sum problem with applications to unstructured information search","display_name":"Polynomial methods for solving the subset sum problem with applications to unstructured information search","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7214283205","doi":"https://doi.org/10.1016/j.procs.2026.08.473"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2026.08.473","doi":"https://doi.org/10.1016/j.procs.2026.08.473","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.08.473","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050926031091/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sciencedirect.com/science/article/pii/S1877050926031091/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120379621","display_name":"Anel Auyezova","orcid":"https://orcid.org/0000-0001-9860-4491","observed_orcids":["https://orcid.org/0000-0001-9860-4491"]},"institutions":[{"id":"https://openalex.org/I4210143508","display_name":"International Information Technologies University","ror":"https://ror.org/042dtza69","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210143508"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Anel Auyezova","raw_affiliation_strings":["International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan","institution_ids":["https://openalex.org/I4210143508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075476248","display_name":"\u0410\u0439\u0433\u0435\u0440\u0438\u043c \u0410\u0439\u0442\u0438\u043c","orcid":"https://orcid.org/0000-0003-2982-214X","observed_orcids":["https://orcid.org/0000-0003-2982-214X"]},"institutions":[{"id":"https://openalex.org/I4210143508","display_name":"International Information Technologies University","ror":"https://ror.org/042dtza69","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210143508"]}],"countries":["KZ"],"is_corresponding":true,"raw_author_name":"Aigerim Aitim","raw_affiliation_strings":["International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan","institution_ids":["https://openalex.org/I4210143508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046321174","display_name":"Aksulu Mukhanova","orcid":"https://orcid.org/0000-0001-6781-5501","observed_orcids":["https://orcid.org/0000-0001-6781-5501","https://orcid.org/0000-0001-9209-3424"]},"institutions":[{"id":"https://openalex.org/I4405252596","display_name":"Q University","ror":"https://ror.org/026vbyp30","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4405252596"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Aksulu Mukhanova","raw_affiliation_strings":["Q University, Bayzakov St 125/185, Almaty 050000, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Q University, Bayzakov St 125/185, Almaty 050000, Kazakhstan","institution_ids":["https://openalex.org/I4405252596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075476248"],"corresponding_institution_ids":["https://openalex.org/I4210143508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.81737553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"290","issue":null,"first_page":"860","last_page":"865"},"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.8339999914169312,"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.8339999914169312,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.07090000063180923,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0494999997317791,"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/subset-sum-problem","display_name":"subset sum problem","score":1.0},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5559999942779541},{"id":"https://openalex.org/keywords/binomial-coefficients","display_name":"binomial coefficients","score":0.8309999704360962},{"id":"https://openalex.org/keywords/exact-search","display_name":"exact search","score":0.5320000052452087},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.4059999883174896},{"id":"https://openalex.org/keywords/decision-support-system","display_name":"decision support system","score":0.593999981880188}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8313999772071838},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.600600004196167},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4966999888420105},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.4415000081062317},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4399000108242035},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4207000136375427},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3801000118255615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.364300012588501},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34630000591278076},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3073999881744385},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26170000433921814}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2026.08.473","doi":"https://doi.org/10.1016/j.procs.2026.08.473","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.08.473","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050926031091/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2026.08.473","doi":"https://doi.org/10.1016/j.procs.2026.08.473","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.08.473","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050926031091/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5040601522","display_name":null,"funder_award_id":"AP26101119","funder_id":"https://openalex.org/F4320322726","funder_display_name":"Ministry of Education and Science of the Republic of Kazakhstan"}],"funders":[{"id":"https://openalex.org/F4320322726","display_name":"Ministry of Education and Science of the Republic of Kazakhstan","ror":"https://ror.org/03pj6ge82"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214283205.pdf","grobid_xml":"https://content.openalex.org/works/W7214283205.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W4410039035","https://openalex.org/W7106605303"],"related_works":["https://openalex.org/W1495714142","https://openalex.org/W4416640753","https://openalex.org/W7143489630","https://openalex.org/W2834193938","https://openalex.org/W7093354098","https://openalex.org/W6962723901","https://openalex.org/W3087160486","https://openalex.org/W7152546778","https://openalex.org/W6925301946","https://openalex.org/W3139422612"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,28,35,54,73],"polynomially":[4],"focused":[5],"methodology":[6,64],"for":[7,94,191],"addressing":[8],"the":[9,24,62,68,80,95,109,114,133,154,159,164],"subset":[10,29,96],"sum":[11,97],"problem":[12],"and":[13,39,53,85,99,141,148,179,202],"evaluates":[14],"its":[15],"relevance":[16,131],"to":[17,66,119,136,163],"unstructured":[18,142],"information":[19,184,204],"retrieval.":[20,205],"The":[21,58,105,129],"research":[22],"addresses":[23],"challenge":[25],"of":[26,30,50,61,82,132,156,166],"determining":[27],"positive":[31],"integers":[32],"that":[33,108],"totals":[34],"certain":[36],"target":[37],"value":[38],"formulates":[40],"an":[41],"accurate":[42],"solution":[43,127],"framework":[44],"utilizing":[45],"combinatorial":[46,70],"mappings,":[47],"symmetry":[48],"characteristics":[49],"binomial":[51],"coefficients,":[52],"merge-based":[55],"building":[56],"method.":[57],"core":[59],"concept":[60],"proposed":[63,160],"is":[65,189],"condense":[67],"original":[69],"parameter":[71],"into":[72],"more":[74,167],"compact":[75],"search":[76,116,137,175],"structure,":[77],"thereby":[78],"reducing":[79,173],"number":[81],"potential":[83],"combinations":[84],"enhancing":[86],"computational":[87,180],"feasibility.":[88],"Based":[89],"on":[90],"this,":[91],"generalized":[92],"methodologies":[93],"issue":[98],"associated":[100],"k-SUM":[101],"formulations":[102],"are":[103,151],"established.":[104],"results":[106],"indicate":[107],"suggested":[110],"method":[111,161],"can":[112],"streamline":[113],"exact":[115],"process":[117],"relative":[118],"traditional":[120],"exponential":[121],"or":[122],"pseudo-polynomial":[123],"approaches,":[124],"while":[125],"maintaining":[126],"accuracy.":[128],"practical":[130],"approach":[134],"pertains":[135],"activities":[138],"inside":[139],"extensive":[140],"data":[143],"environments,":[144],"where":[145],"effective":[146],"filtering":[147],"combination":[149],"matching":[150],"crucial.":[152],"In":[153],"context":[155],"sustainable":[157,192],"development,":[158],"contributes":[162],"design":[165],"resource-efficient":[168],"digital":[169],"intelligence":[170],"systems":[171],"by":[172],"redundant":[174],"operations,":[176],"memory":[177],"usage,":[178],"overhead":[181],"in":[182],"large-scale":[183],"processing":[185],"tasks.":[186],"Such":[187],"efficiency":[188],"important":[190],"decision-support":[193],"systems,":[194],"including":[195],"public":[196],"administration,":[197],"environmental":[198],"monitoring,":[199],"smart-city":[200],"services,":[201],"policy-oriented":[203]},"counts_by_year":[],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2026-09-26T00:00:00"}