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
Journal ArticleDOI
On bounded occurrence constraint satisfaction
TL;DR: It is proved that any constraint satisfaction problem where each variable appears a bounded number of times admits a nontrivial polynomial time approximation algorithm.
Journal ArticleDOI
Query efficient PCPs with perfect completeness
Johan Håstad,Subhash Khot +1 more
TL;DR: A PCP characterization of NP where the verifier uses logarithmic randomness, non-adaptively queries 4 k +k2 bits in the proof, and accepts any supposed proof of a false statement with probability at most 2 −k2 +e.
Proceedings ArticleDOI
Query efficient PCPs with perfect completeness
Johan Håstad,Subhash Khot +1 more
TL;DR: A PCP characterization of NP where the verifier uses logarithmic randomness, queries 4k+k/sup 2/ bits in the proof, accepts a correct proof with probability 1, and accepts any supposed proof of a false statement with a certain maximum probability is presented.
Posted Content
Towards an Optimal Separation of Space and Length in Resolution
Jakob Nordström,Johan Håstad +1 more
TL;DR: In this paper, a tight bound of Theta(sqrt(n)) on the space needed for so-called pebbling contradictions over pyramid graphs of size n was shown.
Posted Content
Making the long code shorter, with applications to the Unique Games Conjecture
TL;DR: Agarwal et al. as discussed by the authors showed that for any eps > 0, there exists an n vertex graph G where every set of o(n) vertices has expansion 1 - eps, but G's adjacency matrix has more than exp(log^delta n) eigenvalues larger than 1-eps, where delta depends only on eps.