Abstract: Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for ...
In quantum computation, designing an optimal exact quantum query algorithm (i.e., a quantum decision tree algorithm) for any small input Boolean function is a fundamental and abstract problem. As we ...
Applicable Analysis and Discrete Mathematics, Vol. 10, No. 2 (October 2016), pp. 408-446 (39 pages) An associative Boolean tree is a plane rooted tree whose internal nodes are labelled by AND or OR ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback