Smoothed Analysis of Interior-Point Algorithms: Condition Number
Abstract
We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.