14 citations · 26 across the 3 of their papers we have counts for
1 paper · 1 filter
László Lovász, Katalin Vesztergombi
A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random…