Nondeterministic Polynomial-time Problem Challenge: An Ever-Scaling Reasoning Benchmark for LLMs

Nondeterministic Polynomial-time Problem Challenge: An Ever-Scaling Reasoning Benchmark for LLMs

15 April 2025

Florian T. Pokorny

ArXiv (abs)PDF HTML

Papers citing "Nondeterministic Polynomial-time Problem Challenge: An Ever-Scaling Reasoning Benchmark for LLMs"

2 / 2 papers shown

Title
Rethinking the Unsolvable: When In-Context Search Meets Test-Time Scaling Fanzeng Xia Yidong Luo Tinko Sebastian Bartels Yaqi Xu Tongxin Li ReLM LRM 93 0 0 28 May 2025
RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models Nguyen Thach Aida Riahifar Nathan Huynh Hau Chan 27 0 0 26 May 2025