An assertion concerning functionally complete algebras and NP-completeness (Q955041): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2061999747
@@ Property / OpenAlex ID: W2061999747 / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the equivalence problem for nonsolvable groups
+Normal rank
@@ Property / cites work @@
+THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
+Normal rank
@@ Property / cites work @@
+The complexity of equivalence for commutative rings
+Normal rank
@@ Property / cites work @@
+COMPLEXITY OF SEMIGROUP IDENTITY CHECKING
@@ Property / cites work: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / rank @@
+Normal rank
@@ Property / cites work @@
+TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
+Normal rank
@@ Property / cites work @@
+Unification in primal algebras, their powers and their varieties
+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 @@
+MONOIDS AND COMPUTATIONS
@@ Property / cites work: MONOIDS AND COMPUTATIONS / rank @@
+Normal rank