RadarDaily batch, 09:00 UTC
Where the P vs NP question stands: circuit and proof-complexity lower bounds, barriers, meta-complexity, geometric complexity theory, new reductions and hardness results, and how the community reads each claimed proof.
78 subscribers