The decision version of the assembly index problem is NP-complete and the optimization version is NP-hard and APX-hard via reduction to the smallest grammar problem.
Assembly theory and its relationship with computational complexity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Computational Complexity of Determining the Assembly Index
The decision version of the assembly index problem is NP-complete and the optimization version is NP-hard and APX-hard via reduction to the smallest grammar problem.