J
Johan Håstad
Researcher at Royal Institute of Technology
Publications - 171
Citations - 16664
Johan Håstad is an academic researcher from Royal Institute of Technology. The author has contributed to research in topics: Approximation algorithm & Mathematical proof. The author has an hindex of 50, co-authored 169 publications receiving 15806 citations. Previous affiliations of Johan Håstad include Massachusetts Institute of Technology.
Papers
More filters
Proceedings ArticleDOI
On the Usefulness of Predicates
Per Austrin,Johan Håstad +1 more
TL;DR: A relaxed notion of an approximate solution of a Max-CSP is introduced, loosely speaking, where the algorithm is allowed to replace the constraints of an instance by some other (possibly real-valued) constraints, and then only needs to satisfy as many of the new constraints as possible.
Proceedings ArticleDOI
Inapproximability - some history and some open problems
TL;DR: The purpose of this talk is to give an overview of the status of some problems in approximability.
Proceedings ArticleDOI
Improved NP-Inapproximability for 2-Variable Linear Equations
TL;DR: An instance of the 2-Lin(2) problem is a system of equations of the form "xi + xj = b (mod 2)" in which it’s possible to satisfy all but an C e fraction of the equations.
Journal Article
Some optimal inapproximability results
TL;DR: In particular, for Max-E 2-Sat, Max-Cut, Maxdi-Cut and Vertex cover, this paper showed that up to an arbitrary e > 0, inapproximability results for max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and set splitting.