9 citations · 16 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 1 cited
Explicit Bounds for Nondeterministically Testable Hypergraph Parameters
Marek Karpinski, Roland Markó
In this note we give a new effective proof method for the equivalence of the notions of testability and nondeterministic testability for uniform hypergraph parameters. We provide t…
cs.DS2015★ 2 cited
On the Complexity of Nondeterministically Testable Hypergraph Parameters
Marek Karpinski, Roland Markó
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…