Attribute-efficient learning of Boolean functions from Post closed classes

DOI10.1515/DMA-2020-0025zbMATH Open1497.68233OpenAlexW3095840438MaRDI QIDQ828191FDOQ828191

Authors: 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

membership queriesexact learningattribute-efficient learningbinary covering arrayPost lattice of closed classes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Learning of bounded-weight Boolean functions

Uses Software

• AETG

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828191)