On Learning Read-k-Satisfy-j DNF

DOI10.1137/S0097539794274398zbMath0907.68145OpenAlexW2021557278MaRDI QIDQ4210120

Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Howard Aizenstein, Avrim L. Blum

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794274398

zbMATH Keywords

computational learning theorylearningdecision treesDNF

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty. ⋮ Learning Read-Constant Polynomials of Constant Degree Modulo Composites ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ Learning read-constant polynomials of constant degree modulo composites

This page was built for publication: On Learning Read-k-Satisfy-j DNF