加载中…
2010-12-09
NP-completeness Proof: RBCDN Reduction Problem
Sujogya BanerjeeShahrzad ShirazipourazadPavel GhoshArunabha Sen
文献摘要
Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本