scientific article; zbMATH DE number 1303029

MaRDI QIDQ4249529zbMATH OpenFDO

Authors Richard Nock, Pascal Jappy, Jean Sallantin

Publication date 17 June 1999

zbMATH Keywords

disjunctive normal formsOccam's razors

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The complexity of generalized graph colorings
• Publication:4725766
• Complexity of conditional colorability of graphs
• scientific article; zbMATH DE number 1294417
• On the capacity of Boolean graph formulæ
• On generalized graph colorings
• scientific article; zbMATH DE number 1185595
• scientific article; zbMATH DE number 1052826
• scientific article; zbMATH DE number 3912409
• On the colorability of \(m\)-composed graphs

Cited in

(6)

• scientific article; zbMATH DE number 1185595 (Why is no real title available?)
• Self-improved gaps almost everywhere for the agnostic approximation of monomials
• Hardness of approximate two-level logic minimization and PAC learning with membership queries
• On domain-partitioning induction criteria: worst-case bounds for the worst-case based
• The complexity of properly learning simple concept classes
• On the capacity of Boolean graph formulæ

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 Q4249529)