Image de couverture de livre

A Knapsack by Any Other Name: Presentation impacts LLM performance on NP-hard problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Duchnowski, Alex, Pavlick, Ellie, Koller, Alexander
Format:	Preprint
Publié:	2025
Sujets:	Computation and Language Computational Complexity 68Q15 I.2.7
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Optimizer Quotient and the Certification Trilemma
par: Simas, Tristan
Publié: (2026)

The Separation of $NP$ and $PSPACE$
par: Lin, Tianrong
Publié: (2021)

The n-vehicle exploration problem is NP-complete
par: Cui, Jinchuan, et autres
Publié: (2023)

NP-hard problems are not in BQP
par: Czerwinski, Reiner
Publié: (2023)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
par: Edwards, Darren J.
Publié: (2025)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
par: Ahn, Jungho, et autres
Publié: (2022)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
par: Abdullah, Duaa, et autres
Publié: (2025)

Fully Characterizing Lossy Catalytic Computation
par: Folkertsma, Marten, et autres
Publié: (2024)

On weighted graph separation problems and flow-augmentation
par: Kim, Eun Jung, et autres
Publié: (2022)

COT: A Generative Approach for Hate Speech Counter-Narratives via Contrastive Optimal Transport
par: Zhang, Linhao, et autres
Publié: (2024)

Polynomial Identity Testing via Evaluation of Rational Functions
par: Hu, Ivan, et autres
Publié: (2022)

Some derivations among Logarithmic Space Bounded Counting Classes
par: Janaki, V., et autres
Publié: (2023)

Understanding the Uncertainty of LLM Explanations: A Perspective Based on Reasoning Topology
par: Da, Longchao, et autres
Publié: (2025)

NERCat: Fine-Tuning for Enhanced Named Entity Recognition in Catalan
par: Ferreres, Guillem Cadevall, et autres
Publié: (2025)

Nested Named Entity Recognition as Single-Pass Sequence Labeling
par: Muñoz-Ortiz, Alberto, et autres
Publié: (2025)

A Stochastic Analysis of the Linguistic Provenance of English Place Names
par: Dalvean, Michael
Publié: (2023)

P not equal to NP
par: Delgado, Daniel Cardona
Publié: (2023)

On the Robustness of Document-Level Relation Extraction Models to Entity Name Variations
par: Meng, Shiao, et autres
Publié: (2024)

ARF-RLHF: Adaptive Reward-Following for RLHF through Emotion-Driven Self-Supervision and Trace-Biased Dynamic Optimization
par: Zhang, YuXuan
Publié: (2025)

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
par: Lagerkvist, Victor, et autres
Publié: (2026)

Unifying lower bounds for algebraic machines, semantically
par: Seiller, Thomas, et autres
Publié: (2018)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
par: Lin, Tianrong
Publié: (2023)

Evolomino is NP-complete
par: Nikolaev, Andrei V.
Publié: (2025)

Beyond the Existential Theory of the Reals
par: Schaefer, Marcus, et autres
Publié: (2022)

Completeness classes in algebraic complexity theory
par: Bürgisser, Peter
Publié: (2024)

Mim-Width is paraNP-complete
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Counting Martingales for Measure and Dimension in Complexity Classes
par: Hitchcock, John M., et autres
Publié: (2025)

Auditing Meta-Cognitive Hallucinations in Reasoning Large Language Models
par: Lu, Haolang, et autres
Publié: (2025)

Aligning LLMs for Multilingual Consistency in Enterprise Applications
par: Agarwal, Amit, et autres
Publié: (2025)

Co-NAML-LSTUR: A Combined Model with Attentive Multi-View Learning and Long- and Short-term User Representations for News Recommendation
par: Nguyen, Minh Hoang, et autres
Publié: (2025)

Can LLM Watermarks Robustly Prevent Unauthorized Knowledge Distillation?
par: Pan, Leyi, et autres
Publié: (2025)

Contrasting Linguistic Patterns in Human and LLM-Generated News Text
par: Muñoz-Ortiz, Alberto, et autres
Publié: (2023)

Algorithms for Minimum Membership Dominating Set Problem
par: Reddy, Sangam Balchandar, et autres
Publié: (2024)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
par: Alpay, Faruk, et autres
Publié: (2026)

Compression Method Matters: Benchmark-Dependent Output Dynamics in LLM Prompt Compression
par: Johnson, Warren
Publié: (2026)

Stiefel optimization is NP-hard
par: Lai, Zehua, et autres
Publié: (2025)

Resolution of The Linear-Bounded Automata Question
par: Lin, Tianrong
Publié: (2021)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
par: Lin, Tianrong
Publié: (2021)

PaperAudit-Bench: Benchmarking Error Detection in Research Papers for Critical Automated Peer Review
par: Tu, Songjun, et autres
Publié: (2026)