Introduces quality control problems and proves that checking whether a graph has the right k-clique count for G_{n,p} takes p^{-Theta(k)} queries, superpolynomially faster than worst-case testing.
If the output btis< t, then reject
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quality control in sublinear time: a case study via random graphs
Introduces quality control problems and proves that checking whether a graph has the right k-clique count for G_{n,p} takes p^{-Theta(k)} queries, superpolynomially faster than worst-case testing.