20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Circuit Minimization: Binary Decision Diagram, Circuit Complexity, AC (complexity) -

English
2026-03-26
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable, but there are effective heuristics such ... Full description

You May Also Like

Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable, but there are effective heuristics such as Karnaugh maps and the Quine-McCluskey algorithm that facilitate the process. The problem with having a complicated circuit (i.e. one with many elements, such as logical gates) is that each element takes up physical space in its implementation and costs time and money to produce in itself.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786133222731
Write Your Own Review
You're reviewing: Circuit Minimization: Binary Decision Diagram, Circuit Complexity, AC (complexity)
Your Rating:

Goodreads Reviews

€133.57 €166.96