Design Algorithm of Optimal NOR Networks by the Branch-and-bound Approach
Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-variable Switching Functions by a Branch-and-bound Computer Program
Pattern-oriented Transformations of NOR Networks
Network Transduction Based on Permissible Functions
Report
Report
Report
Minimization of Logic Networks Under a Generalized Cost Function
Binary Logic Theory for Design of Minimal Decoded-PLA's
Properties of Wired Logic
NOR Network Transduction System
Logic Design and Switching Theory
Logical Design of an Optimum Network by Integer Linear Programming
Logic Networks of Carry-save Adders
Alternative Methods for Solving the CC-table in Gimpel's Algorithm for Synthesizing Optimal Three Level NAND Networks
Exposition of Tison's Method to Derive All Prime Implicants and All Irredundant Disjunctive Forms for a Given Switching Function
Report
Report
Comparison of the Implicit Enumeration Method and the Branch-and-bound Method for Logical Design