A fast algorithm for Boolean function minimization / prepared by Digital Systems Laboratory ; [C.C. Carroll and G.E. Jordan].

Studies the structure of the cellular n-cube representation with emphasis on containment of vertices by cells Derives a computer oriented algorithm for the generation of prime implicants for Boolean functions.

Bibliographic Details
Uniform Title:	Technical report (Auburn University. Project THEMIS) ; AU-T-3.
Corporate Author:	Auburn University. Department of Electrical Engineering. Digital Systems Laboratory
Other Authors:	Jordan, George Edwin, 1944- Carroll, Chester C.
Language:	English
Published:	[Alabama?] : [publisher not identified], 1968.
Series:	Technical report (Auburn University. Project THEMIS) ; AU-T-3.
Subjects:	Algebra, Boolean. Computer algorithms. Switching circuits.
Physical Description:	v, 37 pages : illustrations ; 28 cm.
Format:	Government Document Microfilm Book

System Under Maintenance

Our Library Management System is currently under maintenance.

Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance:

Please contact Reference and Discovery Services via their Contact Form or call them directly at: 517-353-8700 for assistance.