Researchers Call for Spare AI Compute to Improve Circuit Complexity Constants

A complexity researcher has released a circuit lower bound proof (STOC paper 'Explicit functions requiring circuits larger than 4.5n') and is calling on people with spare AI compute to have agent swarms read the paper and improve its cubic cutwidth constant.

2026-11-17 ~ 2026-11-17 · 2 related posts