Amanote Research

Amanote Research

    RegisterSign In

Boolean Factoring and Decomposition of Logic Networks

doi 10.1109/iccad.2008.4681549
Full Text
Open PDF
Abstract

Available in full text

Date

November 1, 2008

Authors
Alan MishchenkoRobert BraytonSatrajit Chatterjee
Publisher

IEEE


Related search

Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability

IPSJ Transactions on System LSI Design Methodology
Electronic EngineeringComputer Science ApplicationsElectrical
2011English

Decomposition With Respect to Outputs for Boolean Control Networks

IFAC Proceedings Volumes
2014English

Dialectical Logic and Boolean Algebra

Journal of Mathematics Research
2019English

Networking Development by Boolean Logic

Nucleus
MedicineCell Biology
2013English

FastStep: Scalable Boolean Matrix Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Boolean Powers: Direct Decomposition and Isomorphism Types

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1981English

Implementation of Boolean AND and OR Logic Gates With Biologically Reasonable Time Constants in Spiking Neural Networks

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Observability of Boolean Multiplex Control Networks

Scientific Reports
Multidisciplinary
2017English

Symbolic Dynamics of Boolean Control Networks

Automatica
ControlSystems EngineeringElectricalElectronic Engineering
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy