Word and decoder retrieval for lettericity are in P; coloring retrieval is GI-equivalent; symmetric lettericity equals neighborhood diversity and is linear-time computable.
Algorithmica88(1), 2 (2026) Towards Settling the Complexity of the Lettericity Problem 17
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Settling the Complexity of the Lettericity Problem
Word and decoder retrieval for lettericity are in P; coloring retrieval is GI-equivalent; symmetric lettericity equals neighborhood diversity and is linear-time computable.