Redian新闻
>
zz recovery question, ask for help
avatar
zz recovery question, ask for help# CS - 计算机科学
s*y
1
发信人: shmimy (睡在窗台上的猫), 信区: EE
标 题: recovery question, ask for help
发信站: Unknown Space - 未名空间 (Thu Mar 10 16:54:20 2005) WWW-POST
Let X be a binary deterministic square matrix.
Let C be a submatrices set that consists of finite number(k) of square
submatrices in X.
Also x_ij=0 if x_ij not in C, o.w. x_ij=1.
Is there a way to find at most k submatrices of ones in X (might be
square)that can cover C?
If you have any idea, please reply to c*********[email protected]
Your suggestion will be appreciated.
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。