Minimization of Boolean functions.

Author

Don Laroy Rogier

Abstract

"A systematic computational procedure is presented for simplifying a Boolean function. The procedure is an extension of the methods presented by W. V. Quine and E. J. McCluskey. Jr. Specific attention is given to the combined use of linear programming and dominance arguments to find a minimum sum of products for large cyclic prime implicant tables"--Abstract, p. ii

Advisor(s)

Johnson, Charles A.

Committee Member(s)

Antle, Charles E.
Joiner, James W., 1931-2013
Chenoweth, Robert D.

Department(s)

Mathematics and Statistics

Degree Name

M.S. in Mathematics

Publisher

University of Missouri at Rolla

Publication Date

1964

Pagination

vi, 64 pages

Note about bibliography

Includes bibliographical references (page 63)

Rights

© 1964 Don Laroy Rogier, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Thesis Number

T 1648

Print OCLC #

5959735

Recommended Citation

Rogier, Don Laroy, "Minimization of Boolean functions." (1964). Masters Theses. 5653.
https://scholarsmine.mst.edu/masters_theses/5653