Query learning of bounded-width OBDDs

DOI10.1007/3-540-61863-5_32MaRDI QIDQ5900845zbMATH OpenOpenAlexFDO

Authors Atsuyoshi Nakamura

Publication date 27 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61863-5_32

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Query learning of bounded-width OBDDs
• An efficient query learning algorithm for ordered binary decision diagrams
• The complexity of minimizing and learning OBDDs and FBDDs
• On testing computability by small width OBDDs
• Lower Bounds for Testing Computability by Small Width OBDDs

Cited in

(8)

• An efficient query learning algorithm for ordered binary decision diagrams
• On learning width two branching programs
• On testing computability by small width OBDDs
• scientific article; zbMATH DE number 6999904 (Why is no real title available?)
• Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
• Query learning of bounded-width OBDDs
• Learning ordered binary decision diagrams
• Query learning algorithm for ordered multi-terminal binary decision diagrams

This page was built for publication: Query learning of bounded-width OBDDs

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