First Page | Document Content | |
---|---|---|
Date: 2014-07-30 08:33:48Conjectures Combinatorial optimization NP-complete problems Mathematical optimization Unique games conjecture computational complexity theory Maximum cut Subhash Khot P versus NP problem Theoretical computer science Mathematics Applied mathematics | Subhash Khot Typically, major math prizes are given for major results. But in this case, Subhash Khot is receiving the Nevanlinna Prize in large part for a conjecture – and even more surprisingly, one whose truth experAdd to Reading ListSource URL: www.mathunion.orgDownload Document from Source WebsiteFile Size: 41,80 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |