2023 - Research.com Mathematics in Sweden Leader Award
2018 - ACM Fellow For contributions in circuit complexity, approximability and inapproximability, and foundations of pseudorandomness
2013 - Fellow of the American Mathematical Society
2007 - Member of Academia Europaea
Johan Håstad spends much of his time researching Discrete mathematics, Combinatorics, Algorithm, Upper and lower bounds and Power. His research integrates issues of Interactive proof system and Zero-knowledge proof in his study of Discrete mathematics. His Combinatorics study combines topics from a wide range of disciplines, such as Computational complexity theory and System of linear equations.
His System of linear equations study incorporates themes from Modulo, Vertex cover and Prime. His work on Pseudorandom generator, Pseudorandomness and Pseudorandom function family as part of general Algorithm research is frequently linked to Extraction and Self-shrinking generator, thereby connecting diverse disciplines of science. Johan Håstad works mostly in the field of Upper and lower bounds, limiting it down to topics relating to Hadamard code and, in certain cases, Hardness of approximation.
Johan Håstad focuses on Discrete mathematics, Combinatorics, Time complexity, Upper and lower bounds and Approximation algorithm. His Unique games conjecture study, which is part of a larger body of work in Discrete mathematics, is frequently linked to Omega, bridging the gap between disciplines. His Combinatorics study combines topics in areas such as Bounded function and Constant.
As a member of one scientific family, Johan Håstad mostly works in the field of Time complexity, focusing on Prime and, on occasion, PCP theorem and Linear equation. His Upper and lower bounds research includes themes of Space, Satisfiability and Proof complexity. Johan Håstad interconnects Optimization problem, Semidefinite programming, System of linear equations and Approximation theory in the investigation of issues within Approximation algorithm.
His primary scientific interests are in Discrete mathematics, Combinatorics, Omega, Logarithm and Binary code. His research in Discrete mathematics intersects with topics in Approximation algorithm and Hierarchy. His biological study spans a wide range of topics, including Upper and lower bounds and Factor graph.
The various areas that Johan Håstad examines in his Upper and lower bounds study include Disjunctive normal form and Limit. His studies deal with areas such as Polynomial and Discrete logarithm as well as Logarithm. His Hypergraph research focuses on subjects like Short Code, which are linked to Hardness of approximation, Binary logarithm and Multiplicative function.
His primary areas of investigation include Discrete mathematics, Combinatorics, Logarithm, Upper and lower bounds and Hierarchy. Hypergraph is the focus of his Discrete mathematics research. Specifically, his work in Combinatorics is concerned with the study of Arity.
His Logarithm research incorporates themes from Discrete logarithm and Integer. His Upper and lower bounds study integrates concerns from other disciplines, such as Graph theory, Polynomial, Limit and Decoding methods. The Hierarchy study combines topics in areas such as Polynomial hierarchy, Circuit complexity and Average-case complexity.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Some optimal inapproximability results
Journal of the ACM (2001)
A Pseudorandom Generator from any One-way Function
Johan HÅstad;Russell Impagliazzo;Leonid A. Levin;Michael Luby.
SIAM Journal on Computing (1999)
Clique is hard to approximate within n/sup 1-/spl epsiv//
foundations of computer science (1996)
Clique is hard to approximate within n1−ε
Acta Mathematica (1999)
Almost optimal lower bounds for small depth circuits
symposium on the theory of computing (1986)
Simple Constructions of Almost k-wise Independent Random Variables
Noga Alon;Oded Goldreich;Johan Håstad;René Peralta.
Random Structures and Algorithms (1992)
Tensor rank is NP-complete
Journal of Algorithms (1990)
Computational limitations of small-depth circuits
Johan Torkel Håstad.
Does co-NP have short interactive proofs?
R. B. Boppana;J. Hastad;S. Zachos.
Information Processing Letters (1987)
On the power of small-depth threshold circuits
Johan Håstad;Mikael Goldmann.
Computational Complexity (1991)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: