不确定图参数测试的复杂性
Complexity of Nondeterministic Graph Parameter Testing
摘要：
我们研究了非确定性可测试图参数的样本复杂性，并将现有的上界改进了几个数量级。所使用的技术也将是独立的利益。我们还讨论了任意阶一致超图的弱不确定性检验的特殊情况。
英文摘要：
We study the sample complexity of nondeterministically testable graph parameters and improve existing bounds on it by several orders of magnitude. The technique used would be also of independent interest. We also discuss the special case of weak nondeterministic testing for uniform hypergraphs of arbitrary order.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
