Efficient learning with equivalence queries of conjunctions of modulo functions

DOI10.1016/0020-0190(95)00126-WzbMath0875.68732OpenAlexW2008069086WikidataQ59538632 ScholiaQ59538632MaRDI QIDQ1350223

Guido Fiorino, Alberto Bertoni, Nicolò Cesa-Bianchi

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00126-w

zbMATH Keywords

Analysis of algorithmsLearning with queriesModulo functions

Mathematics Subject Classification ID

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

Related Items (3)

Learning counting functions with queries ⋮ Disjunctions of negated counting functions are efficiently learnable with equivalence queries ⋮ Preface

Cites Work

• Unnamed Item
• Queries and concept learning
• On Learning Ring-Sum-Expansions
• Learning Integer Lattices

This page was built for publication: Efficient learning with equivalence queries of conjunctions of modulo functions