Complexity of Mutation-Acyclicity and Matrix Mutation Equivalence
Source: hexagonmath.org/abs/2611.00180v1
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00180
curl -X POST /api/v1/records/hexagon/2611.00180/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00180/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'