Complexity theorists breach an 'invisible fence' with Human-AI collaboration in new PRG paper
fortnow · x · 2026-09-25
A new paper by Pooya Hatami with Eshan Chattopadhyay, Chin Ho Lee, Shachar Lovett, Avishay Tal and Emanuele Viola — 'Exponential correlation bounds for polynomials and polylog-seed PRGs for AC0[2]'. Noam Nisan notes complexity theorists imagine an invisible fence beyond which we cannot prove things, and papers like this rarely breach it — a neat example of human-AI collaboration.
More from Research
- Question's Gambit tops BrowseComp-Plus recall with 96.6% using only BM25 — CShorten30 · 2026-09-25
- ICLR page-limit tip: use \textbf instead of \paragraph to save space — jindong_wang92 · 2026-09-25
- AutoScientists NeurIPS paper: self-organizing AI research teams hit 74.4 percentile on BioML-Bench — marinkazitnik · 2026-09-25
- Does the curse of multilinguality have to exist in theory? Embedding-space study — mdredze · 2026-09-25
- From VPG to GRPO: the clean evolution of RL algorithms behind LLM training — cwolferesearch · 2026-09-25
- MechReason: a 12k-QA benchmark exposing multimodal models' mechanical engineering reasoning gap — AndrewDai · 2026-09-25