Color Coding Yields Smaller Depth-3 Circuits for Symmetric Boolean Functions

A surprising result in computational complexity shows that every symmetric Boolean function admits depth-3 circuits of size 2^{O(√n)} via the Alon-Yuster-Zwick color coding technique. Ryan Williams noted he had attempted a similar construction about two years earlier but gave up too soon.

2026-09-30 ~ 2026-09-30 · 2 related posts

• Color coding trick yields 2^O(sqrt(n)) depth-3 AC circuits for all symmetric Boolean functions — rrwilliams · 2026-09-30
• Ryan Williams: I tried this circuit bound two years ago and gave up too soon — rrwilliams · 2026-09-30