Query learning algorithm for ordered multi-terminal binary decision diagrams

DOI10.1016/J.DAM.2024.04.002MaRDI QIDQ6497945zbMATH OpenFDO

Authors Atsuyoshi Nakamura

Publication date 6 May 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.04.002

zbMATH Keywords

query learningsample complexityOMTBDD

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of data (68Pxx) Artificial intelligence (68Txx)

Recommendations

• An efficient query learning algorithm for ordered binary decision diagrams
• Query learning of bounded-width OBDDs
• Learning ordered binary decision diagrams
• Query learning of bounded-width OBDDs
• scientific article; zbMATH DE number 6999904

Cites work

• scientific article; zbMATH DE number 6999904 (Why is no real title available?)
• An efficient query learning algorithm for ordered binary decision diagrams
• Learning ordered binary decision diagrams
• Queries and concept learning

This page was built for publication: Query learning algorithm for ordered multi-terminal binary decision diagrams

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