Sciweavers

472 search results - page 2 / 95
» Functional simulation using binary decision diagrams
Sort
View
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 4 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
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...
Paul Tarau
CCS
2006
ACM
13 years 8 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
ERSHOV
2001
Springer
13 years 9 months ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 9 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
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...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
CEC
2005
IEEE
13 years 10 months ago
Evolving binary decision diagrams using implicit neutrality
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
Richard M. Downing