MOEKA is a specialized user-interview based software system designed for expert knowledge acquisition and representation of monotone Boolean functions. It provides both a command-line interface and a ...
The ANF representation of this function is: f(x1, x0) = 1 XOR x1. The degree of a boolean function is the maximum degree of its monomials in its ANF representation. For example, the degree of the ...
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 ...
Abstract: The growing complexity of today's system designs requires fast and robust verification methods. Existing BDD, SAT or ATPG-based techniques do not provide sufficient solutions for many ...
ABSTRACT: This survey article illustrates many important current trends and perspectives for the field and their applications, of interest to researchers in modern algebra, mathematical logic and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback