COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
From MaRDI portal
Publication:3043639
DOI10.1142/S0218196702001085zbMATH Open1046.08006MaRDI QIDQ3043639FDOQ3043639
Publication date: 6 August 2004
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Varieties (08B99)
Cites Work
- A field guide to equational logic
- Identities satisfied by a finite ring
- Identical relations in finite groups
- ALGORITHMIC PROBLEMS IN VARIETIES
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Finite equational bases for finite algebras in a congruence-distributive equational class
- Polynomial Time Uniform Word Problems
- The complexity of equivalence for commutative rings
- Finite equational bases for congruence modular varieties
- THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
- A four-element algebra whose identities are not finitely based
- Equational Bases for Lattice Theories.
- Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
- Isomorphism Testing of Unary Algebras
- On McKenzie's method
Cited In (18)
- THE MEMBERSHIP PROBLEM IN FINITE FLAT HYPERGRAPH ALGEBRAS
- Computational complexity of learning algebraic varieties
- The equational complexity of Lyndon's algebra
- Dualizability of automatic algebras.
- A finite set of functions with an EXPTIME-complete composition problem
- EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
- Complexity of the identity checking problem for finite semigroups.
- Axiomatisability and hardness for universal Horn classes of hypergraphs
- Nonfinitely based ai-semirings with finitely based semigroup reducts
- INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
- 2004 Summer Meeting of the Association for Symbolic Logic
- The computational complexity of deciding whether a finite algebra generates a minimal variety
- A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
- COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
- A minimal nonfinitely based semigroup whose variety is polynomially recognizable.
- Flat algebras and the translation of universal Horn logic to equational logic
- On varieties of flat nil-semirings
- Finite bases for flat graph algebras
This page was built for publication: COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043639)
