搜索结果: 1-1 共查到“计算机科学技术 Lower Bounds”相关记录1条 . 查询时间(0.015 秒)
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...