Polynomial-time algorithms for generation of prime implicants
type: Item
instance of: scholarly article
title: Polynomial-time algorithms for generation of prime implicants
zbMATH Open document ID: 0768.68061
DOI: 10.1016/0885-064X(92)90033-8
author: Tadeusz Strzemecki
published in: Journal of Complexity
publication date: 1992-09-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 55604
zbMATH Keywords: neighborhood cube
zbMATH Keywords: Boolean function
zbMATH Keywords: disjunctive normal form
zbMATH Keywords: prime implicants
zbMATH Keywords: correctness of algorithms
zbMATH Keywords: time complexity
describes a project that uses: ESPRESSO
MaRDI profile type: Publication
cites work: On simplifying truth-functional formulas
cites work: Q3680754
cites work: Generation of Prime Implicants by Direct Multiplication
cites work: Weighting Method for the Determination of the Irredundant Set of Prime Implicants
cites work: A Local Selection Algorithm for Switching Function Minimization
cites work: On the number of prime implicants
cites work: Maxterm Type Expressions of Switching Functions and Their Prime Implicants
cites work: Minimizability of random Boolean functions
cites work: Q4164776
cites work: MINI: A Heuristic Approach for Logic Minimization
cites work: An incremental method for generating prime implicants/implicates
cites work: Q5824871
cites work: Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs
cites work: Q5732949
cites work: Q5586372
cites work: Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms
cites work: Computational Complexity of Partitioned List Algorithms
cites work: Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
cites work: A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
cites work: An Algorithm for the Automatic Approximate Minimization of Boolean Functions
cites work: Simplest normal truth functions
cites work: Generating Test Examples for Heuristic Boolean Minimization
cites work: The Problem of Simplifying Truth Functions
cites work: A Way to Simplify Truth Functions
cites work: On Cores and Prime Implicants of Truth Functions
cites work: Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem
cites work: Algebraic Topological Methods for the Synthesis of Switching Systems. I
cites work: Q4766895
cites work: Q5187210
cites work: A New Algorithm for Generating Prime Implicants
cites work: Minimization of Switching Functions—A Fast Technique
cites work: Fault Detection in Redundant Circuits
cites work: RST Flip-Flop Input Equations
description: scientific article; zbMATH DE number 55604