科研之友
微信
新浪微博
Facebook
分享链接
摘要
The sensor location flow observability problem is studied from the computational complexity point of view. Although the general problem is shown to be NP-complete, by studying the special cases of input matrix structures and data where the corresponding problems are polynomially solvable, the boundary between NP-complete and polynomial solvable problems is delineated.
- 出版日期2014-12
