Complexity of Nondeterministic Graph Parameter Testing
Marek Karpinski, Roland Mark\'o
TL;DR
This paper investigates the sample complexity involved in nondeterministically testing graph parameters, significantly improving existing bounds and extending the analysis to hypergraphs.
Contribution
It introduces new techniques that substantially reduce the bounds on sample complexity for nondeterministic graph parameter testing and explores hypergraph cases.
Findings
Sample complexity bounds improved by several orders of magnitude.
New techniques of independent interest for testing.
Extension to hypergraphs of arbitrary order.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Complexity and Algorithms in Graphs · Advanced Graph Theory Research