Abstract:Consider any locally checkable labeling problem $$\Pi $$
Π
in rooted regular trees: there is a finite set of labels $$\Sigma $$
Σ
, and for each label $$x \in \Sigma $$
x
∈
Σ
we specify what are permitted label combinations of the children for an internal node of label x (the leaf nodes are unconstrained). This formalism is expressive enough to capt… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.