The computational complexity of deciding whether a finite algebra generates a minimal variety
From MaRDI portal
Publication:4586419
DOI10.1007/978-3-319-74772-9_9zbMath1459.08007OpenAlexW2790053642MaRDI QIDQ4586419
Publication date: 13 September 2018
Published in: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-74772-9_9
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Varieties (08B99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal, locally-finite varieties that are not finitely axiomatizable
- The decidability of the affine completeness generation problem.
- COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
- COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
- A 2EXPTIME Complete Varietal Membership Problem
- The First Order Theory of N-Colorable Graphs
- Alternation
- A Characterization of Minimal Locally Finite Varieties
- Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
- COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
- THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
- THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
- On Comparison of Finite Algebras
- Full duality among graph algebras and flat graph algebras
- Finite bases for flat graph algebras
- Computational complexity of some problems involving congruences on algebras
This page was built for publication: The computational complexity of deciding whether a finite algebra generates a minimal variety
