Computational Aids for Determining the Minimal Form of a Truth Function
- 1 October 1960
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 7 (4) , 299-310
- https://doi.org/10.1145/321043.321044
Abstract
The literature concerned with methods for finding the minimal form of a truth function is, by now, quite extensive. This article extends this knowledge by introducing an algorithm whereby all calculations are performed on decimal numbers obtained from binary-decimal conversion of the terms of the Boolean function. Several computational aids are presented for the purpose of adapting this algorithm to the solution of large-scale problems on a digital computer.Keywords
This publication has 3 references indexed in Scilit:
- An Algorithm for Determining Minimal Representations of a Logic FunctionIEEE Transactions on Electronic Computers, 1957
- A Topological Method for the Determination of the Minimal Forms of a Boolean FunctionIEEE Transactions on Electronic Computers, 1956
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952