Unverified50% confidenceFactExact time
P2NPCBench is a new benchmark comprising 12 question families, each consisting of an NP-complete problem and a polynomial-time solvable problem with identical surface wording.
1
Sources
50%
Confidence
Long-term
Relevance
10/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe P vs NP problem explores whether all problems whose solutions can be quickly verified can also be quickly solved.64% similarUnverifiedP2NPCBench ultimately produces 2,114 hardened problems, accompanied by human-verified reference solutions.64% similarUnverifiedThe benchmark uses a unified set of 100 questions, with only one search issued per question and the same answering model used across all configurations to process the returned content.61% similarUnverifiedMcNemar 检验要求两个模型在完全相同的测试集上评估，任何测试集的不一致都会使检验失效58% similarUnverifiedThe evaluation adopted a paired-sample design in which each type of flaw had one flawed version and one structurally identical but problem-free twin version, used to measure the model's false-positive rate.57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1084107API
curl https://kongchang.com/api/v1/knowledge/claims/1084107MCP
get_claim(id=1084107)