Semialgebraic Proofs and Efficient Algorithm Design
FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, pp. 1-219, 2019.
Over the last twenty years, an exciting interplay has emerged between proof systems and algorithms. Some natural families of algorithms can be viewed as a generic translation from a proof that a solution exists into an algorithm for finding the solution itself. This connection has perhaps been the most consequential in the context of semi...More
Full Text (Upload PDF)
PPT (Upload PPT)