Semialgebraic Proofs and Efficient Algorithm Design

Noah Fleming
Noah Fleming
Pravesh Kothari
Pravesh Kothari

FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, pp. 1-219, 2019.

Cited by: 8|Bibtex|Views27|DOI:https://doi.org/10.1561/0400000086
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments