Learning ordered binary decision diagrams

DOI10.1007/3-540-60454-5_41MaRDI QIDQ6083913zbMATH OpenOpenAlexFDO

Authors Ricard Gavaldà, David Guijarro

Publication date 8 December 2023

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

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

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32)

Recommendations

• An efficient query learning algorithm for ordered binary decision diagrams
• The complexity of minimizing and learning OBDDs and FBDDs
• Query learning of bounded-width OBDDs
• Query learning of bounded-width OBDDs
• Hardness of indentifying the minimum ordered binary decision diagram

Cites work

• scientific article; zbMATH DE number 3594626 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1354131 (Why is no real title available?)
• Improving the variable ordering of OBDDs is NP-complete
• Learning regular sets from queries and counterexamples
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
• Queries and concept learning

Cited in

(4)

• Ordered hypothesis machines
• scientific article; zbMATH DE number 67637 (Why is no real title available?)
• scientific article; zbMATH DE number 6999904 (Why is no real title available?)
• Query learning algorithm for ordered multi-terminal binary decision diagrams

This page was built for publication: Learning ordered binary decision diagrams

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