Proof — Smoothed analysis; spectral sparsification

Statement

Smoothed analysis of LP; graph-based codes; sparsifiers. Proved in ZFC.

Source

IMU Abacus Medal 2010. Smoothed analysis of LP; graph-based codes; sparsifiers. Proved in ZFC.

Domains

computer-science

People

• Daniel Spielman

Related

• Theorem: Smoothed analysis; spectral sparsification
• Proof: Smoothed analysis; spectral sparsification

Explore

• Dashboard
• Theorems
• Frameworks
• Lineage
• People