Rank integrity is XP in the rank parameter k yet W[1]-hard, and is equivalent up to a factor of two to ancilla integrity of graph states for clustering entanglement.
Entanglement in Graph States and its Applications , volume =
1 Pith paper cite this work, alongside 311 external citations. Polarity classification is still indexing.
1
Pith paper citing it
311
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity
Rank integrity is XP in the rank parameter k yet W[1]-hard, and is equivalent up to a factor of two to ancilla integrity of graph states for clustering entanglement.