层次结构
Hierarchies
摘要:
我们研究了由Korman,Peleg和Fraigniaud引入的局部分布环境的复杂性理论。他们定义了三个复杂性类LD(Local Decision),NLD(Nondeterministic Local Decision)和NLD^#n。类LD由所有的语言,可以决定与一个恒定数量的通信轮。类NLD由所有语言组成,这些语言可以通过具有恒定通信轮数的非确定性算法进行验证。为了定义非确定性类,他们通过使用证书和验证器将非确定性的符号转移到分布式设置中。类NLD^#n由所有可以通过非确定性算法验证的语言组成,其中每个节点都可以访问节点数量的oracle。他们已经示出了分层结构LD子集NLD子集NLD^#n。我们的主要贡献是严格的层次结构内定义的科曼,法勒和Fraigniaud类。我们定义了额外的复杂性类:类LD(t)由所有语言组成,这些语言最多可以用t个通信回合来决定。类NLD-O(f)由所有可以由本地验证器验证的语言组成,使得验证语言所需的证书的大小由O(f)的函数限制。我们的主要结果是在这些不确定类的严格层次结构。
英文摘要:
We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。