arXiv cs.CC
Computational Complexity daily digest.
7 past editions, oldest first by date. Atom feed → · all categories
01 — Past editions
most recent first- 2026-07-19 Random Parameter Noise Does Not Make Exact ReLU Verification Easy 1 papers · No. 58
- 2026-07-18 Random Parameter Noise Does Not Make Exact ReLU Verification Easy 1 papers · No. 57
- 2026-07-17 Random Parameter Noise Does Not Make Exact ReLU Verification Easy 1 papers · No. 56
- 2026-07-14 Tropical Circuits with Scalar Multiplication Gates 1 papers · No. 53
- 2026-07-09 Computing with Stochastic Oracles in AI-Augmented Computation 1 papers · No. 48
- 2026-06-24 Token Complexity of Certifying Stochastic-Oracle Reliability 1 papers · No. 33
- 2026-06-16 The Complexity of Min-Max Optimization for Quadratic Polynomials 1 papers · No. 25
Colophon
Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.