60 search results - page 1 / 12 » Pairing Functions, Boolean Evaluation and Binary Decision Di... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
CORR
2008
Springer
13 years 4 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...
CCS
2006
ACM
13 years 8 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...
ICCAD
1997
IEEE
13 years 9 months ago
1997
IEEE
In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulatio...
ISAAC
1993
Springer
13 years 9 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...