Boolean Function Representation Based on Disjoint-Support Decompositions

doi 10.1109/iccd.1996.563527
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc. Press

Related search

Decompositions of a Set Into Disjoint Pairs

Fundamenta Mathematicae
Number TheoryAlgebra
1955English

Dynamics of Random Boolean Networks Under Fully Asynchronous Stochastic Update Based on Linear Representation

PLoS ONE
Multidisciplinary
2013English

Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1999English

Compact Preference Representation and Boolean Games

Autonomous Agents and Multi-Agent Systems
Artificial Intelligence
2008English

A Topological Representation of Double Boolean Lattices

Studia Universitatis Babes-Bolyai Mathematica
Mathematics
2019English

Permutation Representation of Groups With Boolean Orthogonalities

Journal of the Australian Mathematical Society
Mathematics
1981English

Multi-Channel EEG Compression Based on 3D Decompositions

2012English

Variance Function of Boolean Additive Convolution

Statistics and Probability Letters
UncertaintyStatisticsProbability
2020English

Symbolic Manipulation of Boolean Functions Using a Graphical Representation

1985English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy