Quasipolynomial algorithm finds approximate fixed points of ℓ∞ contractions
The method geometrically shrinks the search region and implies simple stochastic games can be solved in quasipolynomial time.
Stories per day · 30 days
2 RSS
Relatedadversarial-rewriting1algorithms1backdoor1bosonic-states1code-generation1fixed-points1formal-methods1gaussian-states1kl-divergence1llm-benchmark1neural-networks1np-complete1parallel-sampling1quantum-information1relu1sampling1stochastic-games1theoretical-cs1
4 stories, newest first · one card per story
Stories tagged #complexity
P2NPCBench finds LLMs weaker on NP-complete twins than on P problems
Twelve models score 35.4% pass@1 on NPC items versus 63.8% on paired P twins; extra time barely helps.
KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling
Theory paper separates two KL measures for parallel sampling, with very different round costs.
Security Properties of Neural Networks as Decision Problems
Researchers classify neural-network security checks as co-NP-complete or harder, including backdoors and parameter faults.