Papers › NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via...

NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes

22 Dec 2023arXiv:2312.14890archive 2025-07-28

Lizhou Fan, Wenyue Hua, Lingyao Li, Haoyang Ling, Yongfeng Zhang

Complex reasoning ability is one of the most important features of current LLMs, which has also been leveraged to play an integral role in complex decision-making tasks. Therefore, the investigation into the reasoning capabilities of Large Language Models (LLMs) is critical: numerous benchmarks have been established to assess the reasoning abilities of LLMs. However, current benchmarks are inadequate in offering a rigorous evaluation of the full extent of reasoning abilities that LLMs are capable of achieving. They are also prone to the risk of overfitting, as these benchmarks, being publicly accessible and static, allow models to potentially tailor their responses to specific benchmark metrics, thereby inflating their performance. Addressing these limitations, our research introduces a new benchmark, named NPHardEval. This benchmark is designed to evaluate the reasoning abilities of LLMs across a broad spectrum of 900 algorithmic questions, extending up to the NP-Hard complexity class. These questions are meticulously chosen to represent a wide range of complexity class below the NP-hard complexity class, offering a rigorous measure of the reasoning ability of LLMs. Through this study, we shed light on the current state of reasoning in LLMs, providing an objective and rigorous perspective through the comparison of LLMs' performance across complex classes. Moreover, this benchmark is designed with a dynamic update mechanism, where the datapoints are refreshed on a monthly basis. Such regular updates play a crucial role in mitigating the risk of LLMs overfitting to the benchmark, promoting a more accurate and reliable assessment of their reasoning capabilities. The benchmark dataset and code of NPHardEval are available at https://github.com/casmlab/NPHardEval.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2312.14890")

Code

Syntology Ran 13 of 13 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 13 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 13 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

casmlab/nphardeval officialmentioned in papermentioned on GitHubApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 13 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

13ran

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from casmlab/nphardeval. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

gcp_decision_check casmlab/nphardeval/Close/check/check_cmp_GCP_D.py official repository ran Apache-2.0 (permissive) · cef31f606aaf119f · report
gcp_greedy_solution casmlab/nphardeval/Close/check/check_cmp_GCP_D.py official repository ran Apache-2.0 (permissive) · 9b9c556b14ca91e2 · report
greedy_tsp casmlab/nphardeval/Close/check/check_hard_TSP.py official repository ran Apache-2.0 (permissive) · 1d9385153fc562b0 · report
kspCheck casmlab/nphardeval/Close/check/check_cmp_KSP.py official repository ran Apache-2.0 (permissive) · f70922a9b0c477bc · report
ksp_optimal_solution casmlab/nphardeval/Close/check/check_cmp_KSP.py official repository ran Apache-2.0 (permissive) · 65c7255263fe6367 · report
load_data casmlab/nphardeval/Open/run/finetune.py official repository ran fingerprinted Apache-2.0 (permissive) · aad4839260ed97a9 · report
mspCheck casmlab/nphardeval/Close/check/check_hard_MSP.py official repository ran Apache-2.0 (permissive) · 94299eebcf1e9f7b · report
parse_answer casmlab/nphardeval/Close/check/check_hard_GCP.py official repository ran Apache-2.0 (permissive) · 78998436efd67437 · report
parse_xml_to_dict casmlab/nphardeval/Close/check/check_hard_GCP.py official repository ran Apache-2.0 (permissive) · 0a4eb48c9fdfc64a · report
read_dimacs_format casmlab/nphardeval/Close/check/check_cmp_GCP_D.py official repository ran Apache-2.0 (permissive) · 6c71a84120d287d5 · report
tspCheck casmlab/nphardeval/Close/check/check_hard_TSP.py official repository ran Apache-2.0 (permissive) · a2816f94b482351b · report
tsp_approx casmlab/nphardeval/Close/check/check_cmp_TSP_D.py official repository ran Apache-2.0 (permissive) · 9702d36b3d6750fa · report
tsp_decision_check casmlab/nphardeval/Close/check/check_cmp_TSP_D.py official repository ran Apache-2.0 (permissive) · 0e92242e90ab63bd · report

Datasets

Introduced by this paper, per the archive.

NPHardEval

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections