scientific article

Curtis T. McMullen, Gary D. Hachtel, Alberto L. Sangiovanni-Vincentelli, Robert K. Brayton

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

VLSI design VLSI circuits logic design combinational circuit minimization algorithms Programmable Logic Arrays multiple-valued logic functions PLA automated logic minimization ESPRESSO-II minimization of logic functions VLSI optimization programs

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items

A multiple-valued logic approach to the design and verification of hardware circuits, Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, Random sequence generation by cellular automata, Approximation techniques for hypergraph partitioning problems, SAT-Based Formula Simplification, Binary Decision Diagrams, Running time experiments on some algorithms for solving propositional satisfiability problems, Fuzzy modelling through logic optimization, BerkMin: A fast and robust SAT-solver, Characterization and computation of ancestors in reaction systems, Variable and term removal from Boolean formulae, Continuous reductions among combinatorial optimization problems, The potential of fuzzy neural networks in the realization of approximate reasoning engines, Implementation of a fuzzy inference system using a normalized fuzzy neural network, A method for minimizing Moore finite-state machines by merging two states, An Equivalence-Preserving Transformation of Shift Registers, Generation of full cycles by a composition of NLFSRs, Computing preimages and ancestors in reaction systems, Hardware implementation of code converters designed to reduce the length of binary encoded words, Partially unate Boolean functions: properties of their sum-of-products representations, Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares, A flexible representation of quantum images for polynomial preparation, image compression, and processing operations, Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule, NEQR: a novel enhanced quantum representation of digital images, Modeling and integer programming techniques applied to propositional calculus, Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes, Extracting reaction systems from function behavior, Local feature point extraction for quantum images, Experimental comparison of decomposition methods for systems of Boolean function, Polynomial-time algorithms for generation of prime implicants, The gene expression matrix: Towards the extraction of genetic network architectures, Nonlinear Codes for Test Patterns Compression: The Old School Way, Horn functions and their DNFs, Characterizing diagnoses and systems, A continuous approach to inductive inference, Optimal complexity reduction of polyhedral piecewise affine systems, Algebraic methods for optimizing constant multiplications in linear systems, Dynamic processor allocation in scalable multiprocessors using boolean algebra^*, FSM Encoding for BDD Representations, Optimal symmetry breaking for graph problems, Minimization of mealy finite-state machines by internal states gluing, Decomposition-based logic synthesis for PAL-based CPLDs, An excursion in reaction systems: from computer science to biology, Computing AES related-key differential characteristics with constraint programming, Decomposing a system of Boolean functions into subsystems of connected functions, The Decomposition Tree for analyses of Boolean functions, Unnamed Item, Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics, Enhancing probabilistic model checking with ontologies, Optimization on the complementation procedure towards efficient implementation of the index generation function, A LATTICE-BASED APPROACH TO THE PROBLEM OF RECRUITMENT IN MULTIAGENT SYSTEMS, Simplification in a satisfiability checker for VLSI applications, A purely map procedure for two-level multiple-output logic minimization, Synthesizing cubes to satisfy a given intersection pattern