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
Circuit Bottom Fan-in and Computational Power
TL;DR: It is shown that in order to compute certain functions, a moderate reduction in circuit bottom fan-in will cause significant increase in circuit size, and that the three input read-modes of alternating Turing machines proposed in the literature are all distinct.
Proceedings ArticleDOI
The complexity of searching a sorted array of strings
TL;DR: Finite strings of characters drawn from an arbitrary, ordered alphabet are considered, here the common assumption that entire strings can be compared in constant time is replaced by the more conservative assumption that only single characters can be compmed in constantTime.
Journal ArticleDOI
Simultaneously good bases of a lattice and its reciprocal lattice
Johan Håstad,Jeffrey C. Lagarias +1 more
TL;DR: In this article, the i-th successive minimum of a lattice of rank n is defined as the smallest value such that there are i linearly independent vectors in L in the ball {x: [I x II _-< ~.i(L)}.
Journal Article
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes.
TL;DR: Barak et al. as mentioned in this paper showed quasi NP-hardness of the following problems on n-vertex hypergraphs: coloring a 2-colorable 8-uniform hypergraph with $2.
Journal ArticleDOI
Relativized perfect zero knowledge is not BPP
Willaim Aiello,Johan Håstad +1 more
TL;DR: It is proved thatthere is an oracle A such that there is a language L which is recognizable by a two round, perfect zero-knowledge interactive proof relative to A, but such that L ∋ BPPA.