Using relevance queries for identification of read-once functions
From MaRDI portal
Publication:376140
DOI10.1007/s10958-013-1401-yzbMath1276.68087OpenAlexW2047225319MaRDI QIDQ376140
Publication date: 4 November 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-013-1401-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial characterization of read-once formulae
- Learning read once functions using subcube parity queries
- Learning regular sets from queries and counterexamples
- On almost bad Boolean bases
- Checking Tests for Read-Once Functions over Arbitrary Bases
- A theory of the learnable
- Learning read-once formulas with queries
- The number of Boolean functions computed by formulas of a given size
This page was built for publication: Using relevance queries for identification of read-once functions
