scientific article; zbMATH DE number 67609
From MaRDI portal
Publication:4013525
Recommendations
Cited in
(15)- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
- The learnability of description logics with equality constraints
- Learning nested differences in the presence of malicious noise
- The learnability of exclusive-or expansions based on monotone DNF formulas
- Free resolutions of function classes via order complexes
- Learning intersection-closed classes with signatures
- A new PAC bound for intersection-closed concept classes
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- DNA sequencing and string learning
- An Algebraic Perspective on Boolean Function Learning
- The functions of finite support: a canonical learning problem
- Learning nested concept classes with limited storage
- Learning nested differences in the presence of malicious noise
- Sample Compression Schemes for Balls in Graphs
- Compression schemes for concept classes induced by three types of discrete undirected graphical models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013525)
