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

什么可以被认证为合格证?

What can be certified compactly?

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

摘要:

本地认证包括将标签(称为\emph{certificates})分配给网络的节点,以认证网络的属性或分布在网络上的数据结构的正确性。这种认证的验证必须是本地的:节点通常只能看到网络中的邻居。衡量认证绩效的主要标准是其证书的大小。2011年,Göös和Suomela将$Θ(\log n)$定义为一种特殊的证书大小:低于此阈值几乎没有可能,并且一些关键属性确实具有这种类型的证书。具有这种小证书的认证现在被称为\emph{compact local certification},它已经成为该领域的黄金标准,类似于集中式计算的多项式时间。一个主要的问题是了解哪些属性有$O(\log n)$证书,或者换句话说:紧凑的本地认证的力量是什么?最近,一系列的论文已经证明了几个著名的网络属性具有紧凑的本地认证:平面性,有界亏格等,但人们希望有更一般的结果,\emph{i.e.}元定理。在多项式时间集中式算法的模拟环境中,一个非常富有成效的方法是证明在具有限制结构的图中,限制类型的问题可以在多项式时间内求解。这些问题通常是那些可以用某种逻辑表达的问题,并且图的结构具有有界的宽度或深度参数。我们采取类似的方法,并证明了第一个元定理的本地认证。(See更多详情请参阅pdf摘要。)

英文摘要:

Local certification consists in assigning labels (called \emph{certificates}) to the nodes of a network to certify a property of the network or the correctness of a data structure distributed on the network. The verification of this certification must be local: a node typically sees only its neighbors in the network. The main measure of performance of a certification is the size of its certificates. In 2011, Göös and Suomela identified $Θ(\log n)$ as a special certificate size: below this threshold little is possible, and several key properties do have certifications of this type. A certification with such small certificates is now called a \emph{compact local certification}, and it has become the gold standard of the area, similarly to polynomial time for centralized computing. A major question is then to understand which properties have $O(\log n)$ certificates, or in other words: what is the power of compact local certification? Recently, a series of papers have proved that several well-known network properties have compact local certifications: planarity, bounded-genus, etc. But one would like to have more general results, \emph{i.e.} meta-theorems. In the analogue setting of polynomial-time centralized algorithms, a very fruitful approach has been to prove that restricted types of problems can be solved in polynomial time in graphs with restricted structures. These problems are typically those that can be expressed in some logic, and the graph structures are whose with bounded width or depth parameters. We take a similar approach and prove the first meta-theorems for local certification. (See the abstract of the pdf for more details.)

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

↑