Some optimal inapproximability results von Hastad, Johan

Volltext

Combinatorial bounds for list decoding von Guruswami, V., Hastad, J., Sudan, M., Zuckerman, D.

Volltext

Linearity testing in characteristic two von Bellare, M., Coppersmith, D., Hastad, J., Kiwi, M., Sudan, M.

Volltext

A pseudorandom generator from any one-way function von HASTAD, J, IMPAGLIAZZO, R, LEVIN, L. A, LUBY, M

Volltext

Tensor rank is NP-complete von Håstad, Johan

Volltext

Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? von HASTAD, J

Volltext

POLYNOMIAL TIME ALGORITHMS FOR FINDING INTEGER RELATIONS AMONG REAL NUMBERS (vol 18, pg 859, 1989) von Håstad, Johan, Just, B., Lagarias, J. C., Schnorr, C. P.

Volltext

Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers von Håstad, J., Just, B., Lagarias, J. C., Schnorr, C. P.

Volltext

Inapproximability - some history and some open problems von Hastad, J.

Volltext

On the Usefulness of Predicates von Austrin, P., Hastad, J.

Volltext

Simple analysis of graph tests for linearity and PCP von Hastad, J., Wigderson, A.

Volltext bestellen

Dual vectors and lower bounds for the nearest lattice point problem von HASTAD, J

Volltext

A Slight Sharpening of LMN von Håstad, Johan

Volltext

Simple analysis of graph tests for linearity and PCP von Håstad, Johan, Wigderson, Avi

Volltext

Query efficient PCPs with perfect completeness von Hastad, J., Khot, S.

Volltext

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers von Hastad, J., Just, B., Lagarias, J. C., Schnorr, C. P.

Volltext

Hardness of approximate hypergraph coloring von GURUSWAMI, Venkatesan, HASTAD, Johan, SUDAN, Madhu

Volltext

The security of all RSA and discrete log bits von Hastad, Johan, Naslund, Mats

Volltext

On the advantage over a random assignment von Håstad, Johan, Venkatesh, S.

Volltext

On the complexity of interactive proofs with bounded communication von Goldreich, Oded, Håstad, Johan

Volltext