搜索结果: 1-1 共查到“数学 probe”相关记录1条 . 查询时间(0.046 秒)
On the complexity of non-unique probe selection
Non-unique probe selection Separable matrices DP-complete P
2012/12/3
We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the minimal d?separable matrix problem is...