Summary
Convex relaxations, such as linear and semidefinite programming, constitute one of the most powerful techniques for designing efficient algorithms, and have been studied in theoretical computer science, operational research, and applied mathematics. The project seeks to...
More information & hyperlinks
Web resources: | http://www.cs.ox.ac.uk/standa.zivny/homepage/powalgdo.html |