141 search results - page 2 / 29 » Boolean Function Representation Using Parallel-Access Diagra... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
104
click to vote
ICCD
1996
IEEE
15 years 1 months ago
1996
IEEE
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
106
click to vote
ISAAC
1993
Springer
15 years 1 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
104
click to vote
EOR
2011
14 years 4 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...