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
The random oracle hypothesis is false
Richard Chang,Benny Chor,Oded Goldreich,Juris Hartmanis,Johan Håstad,Desh Ranjan,Pankaj Rohatgi +6 more
TL;DR: It is shown that for almost all oracles A, IP A ≠ PSPACE A, and the IPP = PSPACE result holds for all oracle worlds.
Proceedings ArticleDOI
Testing of the long code and hardness for clique
TL;DR: It is proved that unless NP = COR, Max Clique is hard to approximate within a factor ni /2 ‘c for any c >0.5 by constructing a proof system for NP which uses 1+6 amortized free bits for any ii >0, by building on the proof system of Bellare, Goldreich and Sudan.
Proceedings ArticleDOI
Simple analysis of graph tests for linearity and PCP
Johan Håstad,Avi Wigderson +1 more
TL;DR: This work gives a simple analysis of the PCP (probabilistically Checkable Proof) with low amortized query complexity of Samorodnitsky and Trevisan (2000) and applies it to the linearity testing over finite fields, giving a better estimate of the acceptance probability.
Journal ArticleDOI
On the advantage over a random assignment
Johan Håstad,S. Venkatesh +1 more
TL;DR: A new measure of approximation, which compares the performance of an approximation algorithm to the random assignment algorithm, is initiated for optimization problems Max‐Lin‐2 in which the authors need to maximize the number of satisfied linear equations in a system of linear equations modulo 2.
Proceedings ArticleDOI
The security of individual RSA bits
Johan Håstad,Mats Näslund +1 more
TL;DR: It is shown that given E/sub N/(X), predicting any single bit in x with only a non-negligible advantage over the trivial guessing strategy is (through a polynomial time reduction) as hard as breaking RSA.