scientific article; zbMATH DE number 3902554
From MaRDI portal
Publication:3680754
Recommendations
Cited in
(68)- Exact Synthesis of ESOP Forms
- Nonlinear Codes for Test Patterns Compression: The Old School Way
- Hardware implementation of code converters designed to reduce the length of binary encoded words
- Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
- Distinguisher and related-key attack on HALFLOOP-96
- Dynamic processor allocation in scalable multiprocessors using boolean algebra*
- Feature necessity \& relevancy in ML classifier explanations
- The gene expression matrix: Towards the extraction of genetic network architectures
- scientific article; zbMATH DE number 3906401 (Why is no real title available?)
- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares
- ESCT minimization for incompletely specified functions
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
- Optimization on the complementation procedure towards efficient implementation of the index generation function
- Characterizing diagnoses and systems
- An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
- Binary decision diagrams
- BerkMin: A fast and robust SAT-solver
- Computing AES related-key differential characteristics with constraint programming
- Two-level logic minimization: an overview
- An excursion in reaction systems: from computer science to biology
- Computing preimages and ancestors in reaction systems
- Partially unate Boolean functions: properties of their sum-of-products representations
- FSM Encoding for BDD Representations
- NEQR: a novel enhanced quantum representation of digital images
- A lattice-based approach to the problem of recruitment in multiagent systems
- Algebraic methods for optimizing constant multiplications in linear systems
- The Decomposition Tree for analyses of Boolean functions
- Modeling and integer programming techniques applied to propositional calculus
- Variable and term removal from Boolean formulae
- scientific article; zbMATH DE number 910866 (Why is no real title available?)
- Extracting reaction systems from function behavior
- The potential of fuzzy neural networks in the realization of approximate reasoning engines
- Fuzzy modelling through logic optimization
- Generation of full cycles by a composition of NLFSRs
- scientific article; zbMATH DE number 4133829 (Why is no real title available?)
- Synthesizing cubes to satisfy a given intersection pattern
- Characterization and computation of ancestors in reaction systems
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
- Simplification in a satisfiability checker for VLSI applications
- Polynomial-time algorithms for generation of prime implicants
- Implementation of a fuzzy inference system using a normalized fuzzy neural network
- A continuous approach to inductive inference
- Principles of logic optimization for a Moore microprogrammed automaton
- scientific article; zbMATH DE number 3871193 (Why is no real title available?)
- A method for minimizing Moore finite-state machines by merging two states
- Compact DSOP and partial DSOP forms
- Experimental comparison of decomposition methods for systems of Boolean function
- A flexible representation of quantum images for polynomial preparation, image compression, and processing operations
- An Equivalence-Preserving Transformation of Shift Registers
- Approximation techniques for hypergraph partitioning problems
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Minimization of mealy finite-state machines by internal states gluing
- Input Variable Assignment and Output Phase Optimization of PLA's
- Horn functions and their DNFs
- Decomposition-based logic synthesis for PAL-based CPLDs
- ULM Implicants for Minimization of Univers Logic Module Circuits
- Local feature point extraction for quantum images
- SAT-Based Formula Simplification
- Continuous reductions among combinatorial optimization problems
- Optimal complexity reduction of polyhedral piecewise affine systems
- Enhancing probabilistic model checking with ontologies
- A purely map procedure for two-level multiple-output logic minimization
- A multiple-valued logic approach to the design and verification of hardware circuits
- Optimal symmetry breaking for graph problems
- Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule
- Random sequence generation by cellular automata
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- Decomposing a system of Boolean functions into subsystems of connected functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680754)
