1. Atici A, Servedio RA (2008) Learning unions of ω(1)-dimensional rectangles. Theoretical Computer Science 405(3):209 – 222
2. Blum A, Furst M, Kearns M, Lipton R (1994) Cryptographic primitives based on hard learning problems. In: Stinson D (ed) Advances in cryptology—CRYPTO ’93. Lecture notes in computer science, vol 773, pp 278–291. Springer, Berlin/Heidelberg
3. Bshouty NH, Feldman V (2002) On using extended statistical queries to avoid membership queries. J Mach Learn Res 2:359–395
4. Bshouty NH, Jackson JC (1999) Learning DNF over the uniform distribution using a quantum example oracle. SIAM J Comput 28(3):1136–1153
5. Bshouty NH, Jackson JC, Tamon C (2004) More efficient PAC-learning of DNF with membership queries under the uniform distribution. J Comput Syst Sci 68(1):205–234