We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers, namely BOOM and FC-Min. Each of these two methods has its own area where it is most efficiently applicable. We have combined these two methods together to be able to solve all kinds of problems efficiently, independently on their size or nature. The tool is very scalable in terms of the required runtime and/or the quality of the solution. It is applicable to functions with an extremely large number of both input and output variables
A computer-aided design procedure for the minimization of multiple-output Boolean functions as encou...
PHIPLA, a new algorithm for logic minimization, is presented. The algorithm sets out to find optimal...
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The a...
This paper presents an algorithm for two-level Boolean minimization (BOOM) based on a new implicant ...
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other ...
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedu...
Abstract: The last stage in the design of intelligent systems is the minimization of its functional ...
The paper presents a minimization algorithm for Boolean functions defined by truth tables. It treats...
This research has established the possibility of improving the effectiveness of the visual-matrix fo...
This research has established the possibility of improving the effectiveness of the visual-matrix fo...
The object of research is the method of figurative transformations for Boolean functions minimizatio...
The reported study has established the possibility of improving the productivity of an algorithm for...
Boolean function manipulation is an important component of computer science. This thesis presents r...
This paper describes a new method for exact hazard-free logic minimization of Boolean functions. Giv...
This paper reports a research that established the possibility of increasing the effectiveness of th...
A computer-aided design procedure for the minimization of multiple-output Boolean functions as encou...
PHIPLA, a new algorithm for logic minimization, is presented. The algorithm sets out to find optimal...
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The a...
This paper presents an algorithm for two-level Boolean minimization (BOOM) based on a new implicant ...
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other ...
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedu...
Abstract: The last stage in the design of intelligent systems is the minimization of its functional ...
The paper presents a minimization algorithm for Boolean functions defined by truth tables. It treats...
This research has established the possibility of improving the effectiveness of the visual-matrix fo...
This research has established the possibility of improving the effectiveness of the visual-matrix fo...
The object of research is the method of figurative transformations for Boolean functions minimizatio...
The reported study has established the possibility of improving the productivity of an algorithm for...
Boolean function manipulation is an important component of computer science. This thesis presents r...
This paper describes a new method for exact hazard-free logic minimization of Boolean functions. Giv...
This paper reports a research that established the possibility of increasing the effectiveness of th...
A computer-aided design procedure for the minimization of multiple-output Boolean functions as encou...
PHIPLA, a new algorithm for logic minimization, is presented. The algorithm sets out to find optimal...
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The a...