Derandomized learning of Boolean functions

DOI10.1007/3-540-63577-7_38MaRDI QIDQ4370218zbMATH OpenFDO

Authors Meera Sitharam, Straney, Timothy

Publication date 18 May 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63577-7_38

zbMATH Keywords

always approximately correctmodel of learning

Mathematics Subject Classification ID

Boolean functions (06E30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Derandomized learning of Boolean functions over finite abelian groups
• Learning Boolean functions with queries
• Boolean formulas are hard to learn for most gate bases
• Exact learning Boolean functions via the monotone theory
• Parallel attribute-efficient learning of monotone Boolean functions

Cited in

(6)

• Learning of bounded-weight Boolean functions
• Learning Boolean functions with queries
• An Algebraic Perspective on Boolean Function Learning
• scientific article; zbMATH DE number 1966612 (Why is no real title available?)
• Pseudo-derandomizing learning and approximation
• Derandomized learning of Boolean functions over finite abelian groups

This page was built for publication: Derandomized learning of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370218)