✦ LIBER ✦

Random low-degree polynomials are hard to approximate

✍ Scribed by Ido Ben-Eliezer; Rani Hod; Shachar Lovett

Book ID: 113014806
Publisher: Springer
Year: 2011
Tongue: English
Weight: 302 KB
Volume: 21
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-011-0020-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entangled Games Are Hard to Approximate

✍ Kempe, Julia; Kobayashi, Hirotada; Matsumoto, Keiji; Toner, Ben; Vidick, Thomas 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 376 KB

Random Cnf’s are Hard for the Polynomial

Random Cnf’s are Hard for the Polynomial Calculus

✍ Eli Ben-Sasson; Russell Impagliazzo 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 457 KB

Some polynomials that are hard to comput

Some polynomials that are hard to compute

✍ J.von zur Gathen; V. Strassen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Random Quantum Circuits are Approximate

Random Quantum Circuits are Approximate 2-designs

✍ Aram W. Harrow; Richard A. Low 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 490 KB

Approximating CVP to Within Almost-Polyn

Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

✍ I. Dinur; G. Kindler; R. Raz; S. Safra 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 512 KB

Polynomials with 0-1 Coefficients That a

Polynomials with 0-1 Coefficients That are Hard to Evaluate

✍ Lipton, Richard J. 📂 Article 📅 1978 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 754 KB