Derandomized learning of Boolean functions over finite abelian groups

DOI10.1142/S0129054101000618MaRDI QIDQ5249274zbMATH OpenWikidataFDO

Authors Meera Sitharam, Straney, Timothy

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054101000618

zbMATH Keywords

Boolean functionsdeterministic learningfinite abelian groupslinearity testingpseudorandom generatorsVC-dimension

Mathematics Subject Classification ID

Finite abelian groups (20K01) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1104345
• scientific article; zbMATH DE number 2080649
• Sampling Boolean functions over Abelian groups and applications
• scientific article; zbMATH DE number 1453047
• An Algebraic Perspective on Boolean Function Learning

Cites work

• Learning read-once formulas with queries
• Learning regular sets from queries and counterexamples
• The equivalence of two problems on the cube

Cited in

(3)

• scientific article; zbMATH DE number 1104345 (Why is no real title available?)
• Sampling Boolean functions over Abelian groups and applications
• On Fourier analysis of sparse Boolean functions over certain abelian groups

This page was built for publication: Derandomized learning of Boolean functions over finite abelian groups

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