News
It has been shown previously that the equivalence of two free Boolean diagrams can be decided probabilistically in polynomial time. Based on the equivalence checking method, we develop a set of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results