{"id":"https://openalex.org/W4416035059","doi":"https://doi.org/10.18653/v1/2025.findings-emnlp.352","title":"A Knapsack by Any Other Name: Presentation impacts LLM performance on NP-hard problems","display_name":"A Knapsack by Any Other Name: Presentation impacts LLM performance on NP-hard problems","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416035059","doi":"https://doi.org/10.18653/v1/2025.findings-emnlp.352"},"language":null,"primary_location":{"id":"doi:10.18653/v1/2025.findings-emnlp.352","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2025.findings-emnlp.352","pdf_url":"https://aclanthology.org/2025.findings-emnlp.352.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: EMNLP 2025","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://aclanthology.org/2025.findings-emnlp.352.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099380660","display_name":"Alex Duchnowski","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alex Duchnowski","raw_affiliation_strings":["Saarland University Brown University Saarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University Brown University Saarland University","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053850863","display_name":"Ellie Pavlick","orcid":"https://orcid.org/0000-0002-7155-5420"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ellie Pavlick","raw_affiliation_strings":["Saarland University Brown University Saarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University Brown University Saarland University","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088112892","display_name":"Alexander Koller","orcid":"https://orcid.org/0000-0002-5317-6689"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Koller","raw_affiliation_strings":["Saarland University Brown University Saarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University Brown University Saarland University","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6628","last_page":"6651"},"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.20250000059604645,"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.20250000059604645,"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/T12176","display_name":"Optimization and Packing Problems","score":0.11860000342130661,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.07370000332593918,"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.6194000244140625},{"id":"https://openalex.org/keywords/presentation","display_name":"Presentation (obstetrics)","score":0.512499988079071},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3199999928474426},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.3089999854564667},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.2773999869823456}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6194000244140625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5404000282287598},{"id":"https://openalex.org/C2777601897","wikidata":"https://www.wikidata.org/wiki/Q3409113","display_name":"Presentation (obstetrics)","level":2,"score":0.512499988079071},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.31189998984336853},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C145097563","wikidata":"https://www.wikidata.org/wiki/Q1148747","display_name":"Payment","level":2,"score":0.23989999294281006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23510000109672546},{"id":"https://openalex.org/C112930515","wikidata":"https://www.wikidata.org/wiki/Q4389547","display_name":"Risk analysis (engineering)","level":1,"score":0.22990000247955322}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18653/v1/2025.findings-emnlp.352","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2025.findings-emnlp.352","pdf_url":"https://aclanthology.org/2025.findings-emnlp.352.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: EMNLP 2025","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.18653/v1/2025.findings-emnlp.352","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2025.findings-emnlp.352","pdf_url":"https://aclanthology.org/2025.findings-emnlp.352.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: EMNLP 2025","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416035059.pdf","grobid_xml":"https://content.openalex.org/works/W4416035059.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"To":[0],"investigate":[1],"the":[2,16,74],"effect":[3],"of":[4,18,27,73],"problem":[5,36,107],"presentation":[6],"on":[7,128],"LLMs'":[8],"ability":[9],"to":[10,137,139],"solve":[11,82],"optimization":[12],"problems,":[13],"we":[14],"introduce":[15],"dataset":[17],"Everyday":[19],"Hard":[20],"Opti":[21],"mization":[22],"Problems":[23],"(EHOP),":[24],"a":[25,112],"collection":[26],"NP":[28],"hard":[29],"problems":[30,55,85],"expressed":[31],"in":[32,42,59,132],"natural":[33],"language.EHOP":[34],"includes":[35],"formulations":[37],"that":[38,50,56,71,118,122],"could":[39,57],"be":[40],"found":[41],"computer":[43],"science":[44],"textbooks":[45],"(e.g.,":[46,62],"graph":[47],"coloring),":[48],"versions":[49],"are":[51,98,124],"dressed":[52],"up":[53],"as":[54],"arise":[58],"real":[60,90],"life":[61,91],"party":[63],"planning),":[64],"and":[65,92,135],"variants":[66],"with":[67],"inverted":[68,93],"rules.We":[69],"find":[70],"state":[72],"art":[75],"LLMs,":[76],"across":[77,106],"multiple":[78],"prompting":[79],"strategies,":[80],"systematically":[81],"text":[83],"book":[84],"more":[86,99],"accurately":[87],"than":[88],"their":[89],"counterparts.While":[94],"reasoning":[95,115],"mod":[96],"els":[97],"capable,":[100],"they":[101,110],"nonetheless":[102],"show":[103],"high":[104],"variance":[105],"presentations,":[108],"suggesting":[109],"lack":[111],"truly":[113],"robust":[114],"mechanism.We":[116],"argue":[117],"this":[119],"constitutes":[120],"evidence":[121],"LLMs":[123],"still":[125],"heavily":[126],"dependent":[127],"what":[129],"was":[130],"seen":[131],"train":[133],"ing":[134],"struggle":[136],"generalize":[138],"novel":[140],"problems.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-11-08T00:00:00"}