Complexity issues of checking identities in finite monoids (Q2655464): Difference between revisions

@@ Property / cites work @@
+Q4536353
@@ Property / cites work: Q4536353 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for finite rings
@@ Property / cites work: The equivalence problem for finite rings / rank @@
+Normal rank
@@ Property / cites work @@
+Results on the equivalence problem for finite groups.
+Normal rank
@@ Property / cites work @@
+Q4846425
@@ Property / cites work: Q4846425 / rank @@
+Normal rank
@@ Property / cites work @@
+THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
+Normal rank
@@ Property / cites work @@
+The complexity of the equivalence problem for nonsolvable groups
+Normal rank
@@ Property / cites work @@
+The complexity of equivalence for commutative rings
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3617672
@@ Property / cites work: Q3617672 / rank @@
+Normal rank
@@ Property / cites work @@
+THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
+Normal rank
@@ Property / cites work @@
+Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
+Normal rank
@@ Property / cites work @@
+Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields
+Normal rank
@@ Property / cites work @@
+The complexity of checking identities for finite matrix rings
+Normal rank