搜索结果: 1-2 共查到“计算机科学技术 OBDDs”相关记录2条 . 查询时间(0.046 秒)
Lower Bounds for Testing Computability by Small Width OBDDs
Lower Bounds for Testing Computability OBDDs
2012/12/4
We consider the problem of testing whether a function f : {0, 1}n → {0, 1} is computable by a read-once, width-2 ordered binary decision diagram (OBDD), also known as a branching program. This problem...
Probabilistic Verification over GF(2m) Using Mod2-OBDDs
Verification Probabilistic OBDD Mod2-OBDD Galois Field GF(2m)
2013/1/28
Formal verification is fundamental in many phases of digital systems design. The most successful verification procedures employ Ordered Binary Decision Diagrams (OBDDs) as canonical representation for...