Video From 14w5051: Approximation Algorithms and the Hardness of Approximation
Wednesday, August 6, 2014 10:08 - 10:39
(2+ε)-SAT is NP-hard
![](http://www.birs.ca/files/images/poster.png)
©2024 Banff International Research Station for Mathematical Innovation and Discovery. All Rights Reserved.