LLM Digest

Story

arxiv_cs_cl · Oct 21, 2026 · paper

Source brief

Did the Problem Actually Get Harder? Testing LLMs on Paired P and NP-Complete Problems Hardened by Adversarial Multi-Agent Rewriting

arxiv.orgOct 21, 2026
original source linked

In brief

Many NP-complete (NPC) problems have a polynomial-time (P) twin that differs in a single structural detail, such as 3- versus 2-colouring a graph. A model that reasons rather than recalls should notice which side of t...

Feed lens

agenteval

Read the original at arxiv.org →Open in live feed Read that day’s brief

Did the Problem Actually Get Harder? Testing LLMs on Paired P and NP-Complete Problems Hardened by Adversarial Multi-Agent Rewriting

Earlier in this thread 4 items

Solve harder problems with AlphaEvolve, now available to everyone on Google Cloud

AgentSWE: Can Coding Agents Build the Agent You Actually Want?

COPEX: Benchmarking LLM Robustness to Adversarial Context Across Model Context Protocol Layers

On the Navier–Stokes Millennium Prize Problem