The following pages link to Johan T. Håstad (Q1083474):
Displaying 50 items.
- (Q3191597) (← links)
- Tensor rank is NP-complete (Q3203928) (← links)
- An Efficient Parallel Repetition Theorem (Q3408184) (← links)
- The square lattice shuffle (Q3419604) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- The square lattice shuffle, correction (Q3467586) (← links)
- On the Approximation Resistance of a Random Predicate (Q3603462) (← links)
- (Q3745271) (← links)
- (Q3775466) (← links)
- Solving Simultaneous Modular Equations of Low Degree (Q3783957) (← links)
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences (Q3800123) (← links)
- (Q3815525) (← links)
- Simple Constructions of Almost k-wise Independent Random Variables (Q4014640) (← links)
- Addendum to “simple constructions of almost k-wise independent random variables” (Q4034713) (← links)
- Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> (Q4210096) (← links)
- (Q4228449) (← links)
- (Q4234106) (← links)
- (Q4252043) (← links)
- (Q4252269) (← links)
- (Q4252728) (← links)
- A Pseudorandom Generator from any One-way Function (Q4268715) (← links)
- (Q4287360) (← links)
- On the Size of Weights for Threshold Gates (Q4307054) (← links)
- The Shrinkage Exponent of de Morgan Formulas is 2 (Q4388862) (← links)
- Circuit Bottom Fan-in and Computational Power (Q4388876) (← links)
- (Q4474190) (← links)
- (Q4526964) (← links)
- (Q4636457) (← links)
- An Average-Case Depth Hierarchy Theorem for Boolean Circuits (Q4640300) (← links)
- Combinatorial bounds for list decoding (Q4674491) (← links)
- Optimal bounds for decision problems on the CRCW PRAM (Q4710686) (← links)
- Simple analysis of graph tests for linearity and PCP (Q4800393) (← links)
- Fitting points on the real line and its application to RH mapping (Q4820904) (← links)
- (Q4870112) (← links)
- Analysis of Backoff Protocols for Multiple Access Channels (Q4895829) (← links)
- (Q4941830) (← links)
- Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound (Q5032501) (← links)
- Recent results in hardness of approximation (Q5054764) (← links)
- Some recent strong inapproximability results (Q5054856) (← links)
- On Small-depth Frege Proofs for Tseitin for Grids (Q5056396) (← links)
- On DNF Approximators for Monotone Boolean Functions (Q5167745) (← links)
- Randomly supported independence and resistance (Q5172743) (← links)
- On the Correlation of Parity and Small-Depth Circuits (Q5173252) (← links)
- Bounded Independence versus Symmetric Tests (Q5205817) (← links)
- On the List-Decodability of Random Linear Codes (Q5281072) (← links)
- (Q5302095) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311553) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- (Q5368897) (← links)
- On the NP-Hardness of Max-Not-2 (Q5419035) (← links)
