✦ LIBER ✦

Cryptographic hardness for learning intersections of halfspaces

✍ Scribed by Adam R. Klivans; Alexander A. Sherstov

Book ID: 108166564
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 210 KB
Volume: 75
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2008.07.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the hardness of learning intersection

On the hardness of learning intersections of two halfspaces

✍ Subhash Khot; Rishi Saket 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Learning intersections and thresholds of

Learning intersections and thresholds of halfspaces

✍ Adam R. Klivans; Ryan O'Donnell; Rocco A. Servedio 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 410 KB

Unconditional lower bounds for learning

Unconditional lower bounds for learning intersections of halfspaces

✍ Adam R. Klivans; Alexander A. Sherstov 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 444 KB

Hardness of Learning Halfspaces with Noi

Hardness of Learning Halfspaces with Noise

✍ Guruswami, Venkatesan; Raghavendra, Prasad 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 318 KB

PAC Learning Intersections of Halfspaces

PAC Learning Intersections of Halfspaces with Membership Queries

✍ S. Kwek; L. Pitt 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 323 KB

Agnostic Learning of Monomials by Halfsp

Agnostic Learning of Monomials by Halfspaces Is Hard

✍ Feldman, Vitaly; Guruswami, Venkatesan; Raghavendra, Prasad; Wu, Yi 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 425 KB