On using the Fourier transform to learn disjoint DNF

DOI10.1016/0020-0190(94)90057-4zbMath0793.68121OpenAlexW2066066292WikidataQ127763872 ScholiaQ127763872MaRDI QIDQ1318745

Roni Khardon

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90057-4

zbMATH Keywords

Fourier transformlearning algorithmcomputational learningmembership queriesDNF

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Related Items (5)

On learning monotone DNF under product distributions ⋮ Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) ⋮ Learning intersections and thresholds of halfspaces ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ Learning DNF from random walks

Cites Work

• Fast learning of \(k\)-term DNF formulas with queries.

This page was built for publication: On using the Fourier transform to learn disjoint DNF