超图参数的非确定性可测性
On the Complexity of Nondeterministically Testable Hypergraph Parameters
摘要：
本文证明了任意阶一致稠密超图的非确定性参数检验和确定性参数检验概念的等价性。它推广了以前只知道简单图的情况下的结果。通过类似的方法，我们也建立了非确定性和确定性超图属性测试之间的等价性，回答了该领域的公开问题。我们引入了一个新的概念，一个切割规范的高阶超图，并采用正则性技术结合ultralimit方法。
英文摘要：
The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a similar method we establish also the equivalence between nondeterministic and deterministic hypergraph property testing, answering the open problem in the area. We introduce a new notion of a cut norm for hypergraphs of higher order, and employ regularity techniques combined with the ultralimit method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
