math.CO — Combinatorics
Complexity of Mutation-Acyclicity and Matrix Mutation Equivalence
Mutation-acyclicity of integral skew-symmetrizable matrices belongs to NP. Mutation equivalence belongs to promise-NP when at least one input is mutation-acyclic. For pairs of mutation-cyclic matrices, mutation equivalence is RE-complete and strongly NP-hard. Both results hold even for connected skew-symmetric matrices.
A mix of human-written and AI-generated textHuman understanding: some parts