11
votes
Accepted
Computational complexity of a preorder of commutativity conditions
It happens that $m\trianglelefteq 1$ for each integer $m\geq 1$. Also, $1\not\trianglelefteq n$ for each integer $n>1$. This allows us to reduce to the case that $m,n>1$.
By Corollary 3.3 in ...
- 19.3k
Only top scored, non community-wiki answers of a minimum length are eligible