The Consensus Algorithm as Applied to Finding Prime Implicants and Covers,

Abstract

The report investigates and improves upon several known methods of finding all the prime implicants of a Boolean function. These procedures are then compared on the basis of their efficiency and the number and types of operations needed to program them. Finally several ways of finding a minimal cover for the function are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1972
Accession Number
AD0746388

Entities

People

  • Mary Kay Emery

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Complex Variables
  • Consensus Algorithms
  • Efficiency
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Systems Analysis and Design