The learnability of exclusive-or expansions based on monotone DNF formulas

DOI10.1016/S0304-3975(99)00265-0zbMath0944.68158OpenAlexW2179605892WikidataQ127706028 ScholiaQ127706028MaRDI QIDQ1575458

Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00265-0

zbMATH Keywords

learnabilitymonotone DNF formulas

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• Exact learning Boolean functions via the monotone theory
• On the Inversion Complexity of a System of Functions
• On the Fourier spectrum of monotone functions

This page was built for publication: The learnability of exclusive-or expansions based on monotone DNF formulas