scientific article; zbMATH DE number 3872682

From MaRDI portal
Publication:3339290





[For the entire collection see Zbl 0537.00003.] This is a survey of results concerning computational complexity of two types of problems in universal algebra: 1) the complexity of testing isomorphism in varieties of algebras; 2) the complexity of testing the first order properties of algebras. E.g. it is shown that the variety of all unary algebras with two idempotent commuting operations is isomorphism complete. A remarkable algorithm for testing whether a given groupoid is a group is sketched.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339290)