PMMSNP problems forbidding monochromatic cliques admit a full complexity dichotomy under the Rich 2-to-1 Conjecture.
42 Michał Karpiński and Krzysztof Piecuch
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Presents a tester for abelian group property testing in the PS-model with time Õ(√|G| + 1/ε), improving on prior linear-time testers.
citing papers explorer
-
Towards infinite PCSP: a dichotomy for monochromatic cliques
PMMSNP problems forbidding monochromatic cliques admit a full complexity dichotomy under the Rich 2-to-1 Conjecture.
-
Sublinear Time Algorithms for Abelian Group Property Testing
Presents a tester for abelian group property testing in the PS-model with time Õ(√|G| + 1/ε), improving on prior linear-time testers.