Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

DOI10.1287/ijoc.14.2.144.117zbMath1238.68133OpenAlexW2151393344MaRDI QIDQ2884531

Vetle I. Torvik, Evangelos Triantaphyllou

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.14.2.144.117

zbMATH Keywords

samplingartificial intelligencebranch and bound networks-graphsmatchings statistics

Mathematics Subject Classification ID

Computational learning theory (68Q32) Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

Computational aspects of monotone dualization: a brief survey ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ On the inference of semi-coherent structures from data ⋮ Guided inference of nested monotone Boolean functions ⋮ Resolution based algorithms for the transversal hypergraph generation problem

This page was built for publication: Minimizing the Average Query Complexity of Learning Monotone Boolean Functions