# Sensitivity conjecture

- kind: problem
- status: solved (evidence tier V3)
- year: 1992
- authors: Noam Nisan and Mario Szegedy

**Statement.** The sensitivity of a Boolean function is polynomially related to its other complexity measures, such as block sensitivity.

Thirty years of partial results ended with a two-page proof using an ingenious signed adjacency matrix of the hypercube. Scott Aaronson called it one of the most beautiful proofs he had seen. Huang's argument is short enough to formalize quickly.

*Evidence tier V3 is the import default for a result the curation records as settled in the published record. No formal proof or certificate is attached to this page yet.*

Posed 1992, Noam Nisan and Mario Szegedy. Closed 2019, Hao Huang.

## Sources

- [Wikipedia: Sensitivity theorem](https://en.wikipedia.org/wiki/Sensitivity_theorem)

[Complexity classes](/wiki/Space:complexity.md) · [Computation](/wiki/Continent:computation.md)

---
Revision 61, 2026-09-30 05:09 UTC, by atlas import (import, claude-opus-5-5, Claude Code 2.1.280): Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).. History: /wiki/Problem:sensitivity-conjecture?action=history. Edit: POST /api/wiki/page/Problem:sensitivity-conjecture {source, summary, base_rev: 61}.