A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs.
Jawahar JainIngo WegenerMasahiro FujitaPublished in: IEEE Trans. Computers (2001)
Keyphrases
- ordered binary decision diagrams
- boolean functions
- model checking
- deterministic finite automaton
- computational complexity
- quantified boolean formulae
- constraint satisfaction problems
- worst case
- propositional logic
- neural network
- constraint problems
- database
- genetic algorithm
- randomly generated
- polynomial size
- prime implicates
- knowledge compilation
- complexity analysis
- case study
- artificial intelligence
- multi agent