A graph theoretic approach to switching function minimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- A New Technique for the Fast Minimization of Switching Functions
- A Prime Implicant Algorithm with Factoring
- A characterization of hypercubes
- Algebraic Topological Methods for the Synthesis of Switching Systems. I
- Computationally Related Problems
- Depth-First Search and Linear Graph Algorithms
- Distance-preserving subgraphs of hypercubes
- Fault Detection in Redundant Circuits
- Heuristic Algorithm for Reducing Large Product-of-Sums Logical Expressions
- Irreducible Topological Components of an Arbitrary Boolean Truth Function and Generation of Their Minimal Coverings
- Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function
- Minimization of Boolean Functions
- Minimization of Switching Functions—A Fast Technique
- Minimization of disjunctive normal forms of fuzzy logic functions
- On the complexity of testing a graph for n-cube
- On the computational power of pushdown automata
- Parallel concepts in graph theory
- RST Flip-Flop Input Equations
- The Computational Complexity of a Class of Minimization Algorithms for Switching Functions
- The Problem of Simplifying Truth Functions
- Useless prime implicants of incompletely specified multiple-output switching functions
This page was built for publication: A graph theoretic approach to switching function minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168952)
