A new notion of local hardness reduction lets lower bounds on local certification certificate size be transferred between graph properties, yielding polynomial lower bounds for many coNP-hard problems.
Locally checkable proofs in distributed computing.Theory Comput., 12(1):1–33, 2016
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Reductions in local certification
A new notion of local hardness reduction lets lower bounds on local certification certificate size be transferred between graph properties, yielding polynomial lower bounds for many coNP-hard problems.