arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.02034cs.CC
收藏

字符串匹配:通信,电路和学习

String Matching: Communication, Circuits, and Learning

Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar

摘要:

字符串匹配是确定给定的$n$位串是否包含给定的$k$位模式的问题。我们研究这个问题的复杂性在三个设置。通信复杂性。对于小的$k$,我们提供了接近最佳的上限和下限的通信复杂性的字符串匹配。对于大的$k$,我们的界限留下了一个指数差距,我们展示了一些证据,存在一个更好的协议。电路复杂性。我们提出了几个上限和下限的阈值和DeMorgan门解决串匹配问题的电路的大小。与上面类似,我们的边界对于小$k$是接近最优的。学习我们考虑的问题,学习一个隐藏的模式的长度最多$k$相对于分类器,分配1到每个字符串,包含模式。我们证明了这个问题的VC维和样本复杂性的最佳界。

英文摘要:

String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper and lower bounds on the communication complexity of string matching. For large $k$, our bounds leave open an exponential gap; we exhibit some evidence for the existence of a better protocol. Circuit complexity. We present several upper and lower bounds on the size of circuits with threshold and DeMorgan gates solving the string matching problem. Similarly to the above, our bounds are near-optimal for small $k$. Learning. We consider the problem of learning a hidden pattern of length at most $k$ relative to the classifier that assigns 1 to every string that contains the pattern. We prove optimal bounds on the VC dimension and sample complexity of this problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑