Improving the variable ordering of OBDDs is NP-complete

This publication has 16 references indexed in Scilit:

• Functional approaches to generating orderings for efficient symbolic representations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Dynamic variable ordering for ordered binary decision diagrams
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Reduction of OBDDs in linear time
  Information Processing Letters, 1993
• NC-ALGORITHMS FOR OPERATIONS ON BINARY DECISION DIAGRAMS
  Parallel Processing Letters, 1993
• The complexity of the optimal variable ordering problems of shared binary decision diagrams
  Published by Springer Nature ,1993
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams
  Published by Association for Computing Machinery (ACM) ,1991
• Finding the optimal variable ordering for binary decision diagrams
  IEEE Transactions on Computers, 1990
• The complexity of equivalence and containment for free single variable program schemes
  Published by Springer Nature ,1978