Quine-McCluskey algorithm | Boolean Function, Karnaugh Map, Exponential Growth, Espresso Heuristic Logic Minimizer, Canonical form, Boolean Algebra, Circuit Minimization

Lambert M. Surhone (u. a.)

ISBN 10: 6130342675 / ISBN 13: 9786130342678

Published by OmniScriptum, 2026

About this Item

Quine-McCluskey algorithm | Boolean Function, Karnaugh Map, Exponential Growth, Espresso Heuristic Logic Minimizer, Canonical form, Boolean Algebra, Circuit Minimization | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130342678 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 113214327

Bibliographic Details

• Title: Quine-McCluskey algorithm | Boolean Function, Karnaugh Map, Exponential Growth, Espresso Heuristic Logic Minimizer, Canonical form, Boolean Algebra, Circuit Minimization
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6130342675
• ISBN 13: 9786130342678
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 4D millimeters 220 millimeters width by 150 millimeters height by 4 millimeters depth
• Weight: 113 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. e–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms, and it also gives a deterministic way to check that the minimal form of a Boolean function has been reached. It is sometimes referred to as the tabulation method.