{"id":"https://openalex.org/W4416640583","doi":"https://doi.org/10.1016/j.procs.2025.10.229","title":"Solving NP-Complete Problems via Language Models: A Case Study with BERT","display_name":"Solving NP-Complete Problems via Language Models: A Case Study with BERT","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416640583","doi":"https://doi.org/10.1016/j.procs.2025.10.229"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.10.229","doi":"https://doi.org/10.1016/j.procs.2025.10.229","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.229","pdf_url":null,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","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://doi.org/10.1016/j.procs.2025.10.229","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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/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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075476248"],"corresponding_institution_ids":["https://openalex.org/I4210143508"],"apc_list":null,"apc_paid":null,"fwci":2.8448,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.92194326,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"272","issue":null,"first_page":"445","last_page":"450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.2883000075817108,"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"}},"topics":[{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.2883000075817108,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.25459998846054077,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1891999989748001,"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/np-complete-problems","display_name":"NP-complete problems","score":0.9959999918937683},{"id":"https://openalex.org/keywords/bert","display_name":"BERT","score":0.9739999771118164},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.8830000162124634},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9950000047683716},{"id":"https://openalex.org/keywords/sequence-prediction","display_name":"sequence prediction","score":0.75},{"id":"https://openalex.org/keywords/fine-tuning","display_name":"fine-tuning","score":0.6779999732971191},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.36899998784065247}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8773999810218811},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.8245000243186951},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6748999953269958},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6043999791145325},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.4993000030517578},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4977000057697296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4876999855041504},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4797999858856201},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46369999647140503},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.43130001425743103},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4284000098705292},{"id":"https://openalex.org/C2779439875","wikidata":"https://www.wikidata.org/wiki/Q1078276","display_name":"Natural language understanding","level":3,"score":0.39969998598098755},{"id":"https://openalex.org/C35639132","wikidata":"https://www.wikidata.org/wiki/Q7452468","display_name":"Sequence labeling","level":3,"score":0.3813999891281128},{"id":"https://openalex.org/C195324797","wikidata":"https://www.wikidata.org/wiki/Q33742","display_name":"Natural language","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C66024118","wikidata":"https://www.wikidata.org/wiki/Q1122506","display_name":"Computational model","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.3086000084877014},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30230000615119934},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C2777601683","wikidata":"https://www.wikidata.org/wiki/Q6499736","display_name":"Vocabulary","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C155092808","wikidata":"https://www.wikidata.org/wiki/Q182557","display_name":"Computational linguistics","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.10.229","doi":"https://doi.org/10.1016/j.procs.2025.10.229","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.229","pdf_url":null,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","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.2025.10.229","doi":"https://doi.org/10.1016/j.procs.2025.10.229","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.229","pdf_url":null,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2344306416","https://openalex.org/W6893237833","https://openalex.org/W6893211658","https://openalex.org/W1942527287","https://openalex.org/W4406318543","https://openalex.org/W169688183","https://openalex.org/W7097020118","https://openalex.org/W2981508393","https://openalex.org/W6912162565","https://openalex.org/W7078984545"],"abstract_inverted_index":{"NP-complete":[0],"issues":[1,153],"provide":[2,119,189],"a":[3],"considerable":[4,132],"challenge":[5],"in":[6,36],"computational":[7,150,180],"complexity":[8],"owing":[9],"to":[10,54,71,101,127,144,155,192],"their":[11],"extensive":[12,26],"solution":[13,168],"spaces":[14],"and":[15,41,80,108,121,149,161,179],"the":[16,49,75,81,106,112,156,162,173],"absence":[17],"of":[18,51,74,158,164,176],"fast":[19],"strategies":[20],"for":[21,57,105,111,125,167],"obtaining":[22],"precise":[23],"solutions.":[24],"Concurrently,":[25],"language":[27,185],"models":[28],"like":[29],"as":[30,63,86],"BERT":[31,53,91,100,117],"have":[32],"exhibited":[33],"robust":[34],"proficiency":[35],"pattern":[37],"recognition,":[38],"sequence":[39,64,147],"modeling,":[40],"reasoning":[42],"with":[43,90,152],"structured":[44],"data.":[45],"This":[46,170],"work":[47],"examines":[48],"viability":[50],"utilizing":[52],"approximate":[55],"solutions":[56,124,191],"NP-Complete":[58],"problems":[59],"by":[60],"recontextualizing":[61],"them":[62],"prediction":[65],"tasks.":[66],"Encoding":[67],"techniques":[68,187],"are":[69],"devised":[70],"encode":[72],"instances":[73],"Boolean":[76],"Satisfiability":[77],"Problem":[78,84],"(SAT)":[79],"Traveling":[82],"Salesman":[83],"(TSP)":[85],"token":[87],"sequences":[88],"compatible":[89],"processing.":[92],"Experiments":[93],"performed":[94],"on":[95,146],"benchmark":[96],"datasets":[97],"entail":[98],"fine-tuning":[99],"forecast":[102],"variable":[103],"assignments":[104],"SAT":[107],"city":[109],"tours":[110],"TSP.":[113],"Results":[114],"demonstrate":[115],"that":[116],"can":[118],"viable,":[120],"frequently":[122],"near-optimal,":[123],"small":[126],"moderate":[128],"problem":[129],"sizes,":[130],"providing":[131],"time":[133],"benefits":[134],"over":[135],"traditional":[136],"solvers.":[137],"Nonetheless,":[138],"challenges":[139,193],"persist":[140],"concerning":[141],"scalability":[142],"due":[143],"restrictions":[145],"length":[148],"resources,":[151],"related":[154],"interpretability":[157],"model":[159],"outputs":[160],"lack":[163],"theoretical":[165],"assurances":[166],"quality.":[169],"research":[171],"enhances":[172],"emerging":[174],"convergence":[175],"machine":[177],"learning":[178],"complexity,":[181],"demonstrating":[182],"how":[183],"natural":[184],"processing":[186],"may":[188],"innovative":[190],"traditionally":[194],"deemed":[195],"intractable":[196],"within":[197],"conventional":[198],"computing":[199],"frameworks.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-10-04T09:36:47.201465","created_date":"2025-11-25T00:00:00"}