AI Briefing#complexity-theory
The latest AI and developer news about #complexity-theory, with the original source and a short summary.
The latest AI and developer news about #complexity-theory, with the original source and a short summary.
The proof, verified by Lean, establishes that quantum computers cannot achieve exponential speedups on random inputs without specific structural patterns.
They built an interactive proof system that can efficiently verify complex properties of data distributions using limited resources.
Testing location-invariant properties of functions and testing properties of distributions are similar, but the relationship between the two concepts does not hold in the verification stage.
A claim that complexity theory proves the impossibility of human-level performance based on ML has been refuted.
The NPHardEval leaderboard, which dynamically evaluates LLMs' logical reasoning ability using complexity classes, has been released.