The following pages link to Johan T. Håstad (Q1083474):
Displaying 18 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- A simple lower bound for monotone clique using a communication game (Q1190521) (← links)
- On average time hierarchies (Q1313704) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- On the list-decodability of random linear codes (Q2875168) (← links)
- On the usefulness of predicates (Q2947573) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- On the power of many one-bit provers (Q2986871) (← links)
- Hardness of Approximate Hypergraph Coloring (Q3149889) (← links)
- Solving Simultaneous Modular Equations of Low Degree (Q3783957) (← links)
- Circuit Bottom Fan-in and Computational Power (Q4388876) (← links)
- Fitting points on the real line and its application to RH mapping (Q4820904) (← links)
- Randomly supported independence and resistance (Q5172743) (← links)
- The security of all RSA and discrete log bits (Q5501189) (← links)
- Approximating Linear Threshold Predicates (Q5901178) (← links)
