Witness Sets

Gérard Cohen,Hugues Randriam,Gilles Zémor

Lecture Notes in Computer Science（2008）

引用 0|浏览0

暂无评分

摘要

Given a set C of binary n-tuples and c ∈ C, how many bits of c suffice to distinguish it from the other elements in C ? We shed new light on this old combinatorial problem and improve on previously known bounds.

查看译文

关键词

witness sets

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要