Exact learning of subclasses of CDNF formulas with membership queries
From MaRDI portal
Publication:6184662
DOI10.1007/3-540-61332-3_151zbMath1529.68124OpenAlexW1518272602MaRDI QIDQ6184662
Publication date: 29 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/96475
Cites Work
- Unnamed Item
- Unnamed Item
- Queries and concept learning
- Exact learning Boolean functions via the monotone theory
- Read-twice DNF formulas are properly learnable
- Complexity of identification and dualization of positive Boolean functions
- A theory of the learnable
- Learning read-once formulas with queries
- Learning Decision Trees Using the Fourier Spectrum
This page was built for publication: Exact learning of subclasses of CDNF formulas with membership queries
