Approximability and Proof Complexity |
||
Approximability and Proof Complexity
Approximability and Proof Complexity is a research project in Theoretical Computer Science at KTH Royal Institute of Technology, funded by the Knut and Alice Wallenberg Foundation. ContactPlease send e-mail to apc@eecs.kth.se if you have any questions. |
|