Statistical Complexity of Algorithms for Boolean Function Minimization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Statistical Complexity of Algorithms for Boolean Function Minimization

Full text

Pdf (659 KB)

Source

Journal of the ACM (JACM) archive
Volume 12 , Issue 3 (July 1965) table of contents

Pages: 364 - 375

Year of Publication: 1965

ISSN:0004-5411

Authors

Franco Mileto	Olivetti Electronic Research Laboratory, Milan, Italy
Gianfranco Putzolu	Olivetti Electronic Research Laboratory, Milan, Italy

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 26, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321281.321287 What is a DOI?

ABSTRACT

The first problem in a two level Boolean minimization is the determination of the prime k-cubes. This paper is concerned with the estimation of the statistical complexity of some well-known algorithms which solve this problem. Formulas are given for the average number of comparison operations among k-cubes occurring in Quine's method and in Mc-Cluskey's method; these quantities provide indications of the average execution time of computer programs based on the corresponding algorithms. Numerical values are given and commented on. Formulas are also obtained for the variance of the number of k-cubes and the variance of the number of cubes of a Boolean function; in fact the calculation of these quantities is strictly related to that of the average number of comparison operations among k-cubes. These variances give an idea of the probable error made by using the corresponding average values (obtained in a previous paper by the authors) to make forecasts. It turns out that this error is quite small.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	MILETO, F., AND PUTZOLU, G. Average values of quantities appearing ia Boolean function minimization. IEEE Trans. EC-I3, 2 (Apr. 1964), 87-92.
	2	QuINE, W. V. The problem of simplifying truth functions. Amer. Math. Monthly 59, 8 (Oct. 1952), 521-531.
	3	McCLusY, E. J. Jn. Miniraization of Boolean functions. Bell Sys. Tech. Y. 85, 6 (Nov. 1956), 1417-1444.
	4	FELLER, W. An Introduction to Probability Theory and Its Applications, Vol. I. Wiley, New York, 1960.
	5	DIg TROYE, N. C. Classification and minimization of switching functions. Philips Res. Reps. 14, 1959, 250-292.
	6	ROTH, J. D. Algebraic topological methods for the synthesis of switching systems, I. Trans. Amer. Math. Soc. 88 (July, 1958), 301-326.