作者: C. Mccrosky , Yuke Wang
DOI:
关键词:
摘要: Boolean function manipulation is an important component of computer science. This thesis presents results related to representation and minimization. The minimization problem re-defined. A new classification theory based on permutation extension developed. More efficient algorithms can be derived the theory. also examines complexity issues graph structure OBDDs some special functions. Moreover, data structures for functions are reported in this thesis. Some found have constant while having exponential existing structures.