Jun. Jui. 2018 Aug.
SunMonTueWedThuFriSat
01 02 03 04 050607
080910 11121314
15161718192021
22232425262728
29303101020304
Click Seminar

TOPICS (Detail)

Publishing dayAugust 29, 2012 10:35:35 By shirai
Title

Counterexamples to the long-standing conjecture on the complexity of BDD

ContentWe disprove the long-standing conjecture, proposed by R.E. Bryant in 1986, that his binary decision diagram (BDD) algorithm computes any binary operation on two Boolean functions in linear time in the input–output sizes. See the details on the paper published in "Information Processing Letters".