Minimization of Boolean functions of any number of variables using decimal labels
type: Item
instance of: scholarly article
title: Minimization of Boolean functions of any number of variables using decimal labels
zbMATH Open document ID: 0569.94023
DOI: 10.1016/0020-0255(83)90044-0
published in: Information Sciences
publication date: 1983-01-01T00:00:00Z
review text: This paper deals with the problem of minimization of a Boolean function, particularly when the number of variables is very large. Using the decimal labels of the minterms, a table is worked out which helps to determine all the prime implicants and the essential prime implicants. A systematic method of sorting out the dominating and the dominated columns is then given, which helps to reduce the number of successive cover tables considerably.
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 3910307
zbMATH Keywords: prime implicants
author: Malay K. Sen
MaRDI profile type: Publication
full work available at URL: 0020-0255(83)90044-0
OpenAlex ID: W2078951189
cites work: The Problem of Simplifying Truth Functions
cites work: Minimization of Boolean Functions
cites work: Q5328409
cites work: Q3263088
description: scientific article; zbMATH DE number 3910307