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
Every 2-CSP allows nontrivial approximation
TL;DR: Semidefinite programming is used to prove that any constraint satisfaction problem in two variables over any domain allows an efficient approximation algorithm that does provably better than picking a random assignment.
Journal ArticleDOI
Fitting points on the real line and its application to RH mapping
TL;DR: The MATRIX-TO-LINE algorithm is applied to the Radiation Hybrid problem, namely, the algorithmic part of a physical mapping method called RH mapping, and is shown to be the first algorithm with a guaranteed convergence for the general RH problem.
Journal Article
(2+ε)-SAT is NP-hard.
TL;DR: It is proved that given a CNF-formula where each clause has width w and the guarantee that there exis width w, the CNFsatisfiability problem can be solved with a natural promise variant.
Journal ArticleDOI
Dual vectors and lower bounds for the nearest lattice point problem
TL;DR: It is proved that given a point z outside a given latticeL then there is a dual vector which gives a fairly good estimate for how far from the lattice the vector is.
Proceedings ArticleDOI
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
TL;DR: Improved inapproximability results for hypergraph coloring using the low-degree polynomial code of Barak et.