An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
檔案
- 000248864800003.pdf (271.9 KB, Adobe PDF)
日期
2007-10-01
期刊名稱
JOURNAL OF COMBINATORIAL OPTIMIZATION
摘要
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relation among these four problems, and use this equivalence to improve current results on graph testing. In the rest of this paper, we give a lower bound for the minimum number of tests on DNA complex screening model.
所屬典藏
會議論文引用此條目
Chen, H. B., Du, D. Z., & Hwang, F. K. (2007). An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. JOURNAL OF COMBINATORIAL OPTIMIZATION, 14(2-3), 121–129. https://doi.org/10.1007/s10878-007-9067-3
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/3974