Attribute-efficient learning of Boolean functions from Post closed classes

DOI10.1515/dma-2020-0025zbMath1497.68233OpenAlexW3095840438MaRDI QIDQ828191

Anastasiya V. Bistrigova

Publication date: 8 January 2021

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2020-0025

zbMATH Keywords

exact learningmembership queriesattribute-efficient learningbinary covering arrayPost lattice of closed classes

Mathematics Subject Classification ID

Computational learning theory (68Q32) Boolean functions (06E30)

Related Items (1)

Learning of bounded-weight Boolean functions

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of binary covering arrays
• Partial covering arrays: algorithms and asymptotics
• A survey of methods for constructing covering arrays
• On parallel attribute-efficient learning.
• Adaptive versus nonadaptive attribute-efficient learning
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• Cardinality of generating sets for operations from the Post lattice classes
• Sperner capacities
• Families of \(k\)-independent sets
• On learning monotone Boolean functions with irrelevant variables
• Rendezvous Search on the Line
• Minimax Rendezvous on the Line
• Covering arrays and intersecting codes
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Attribute-efficient learning of Boolean functions from Post closed classes