Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P.
['Martin Sauerhoff', 'Ingo Wegener']
I am writing a research paper on a idea On the complexity of minimizing the OBDD size for incompletely specified functions
[{"from": "human", "value": "I am writing a research paper on a idea On the complexity of minimizing the OBDD size for incompletely specified functions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P."}]