9 citations · 16 across the 6 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 2 cited
Complexity of Nondeterministic Graph Parameter Testing
Marek Karpinski, Roland Markó
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…
cs.DS2014★ 2 cited
Limits of CSP Problems and Efficient Parameter Testing
Marek Karpinski, Roland Markó
We present a unified framework on the limits of constraint satisfaction problems (CSPs) and efficient parameter testing which depends only on array exchangeability and the method o…