Pages that link to "Item:Q3043639"
From MaRDI portal
The following pages link to COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES (Q3043639):
Displaying 17 items.
- A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). (Q494618) (← links)
- The equational complexity of Lyndon's algebra (Q539978) (← links)
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- Nonfinitely based ai-semirings with finitely based semigroup reducts (Q2079231) (← links)
- A minimal nonfinitely based semigroup whose variety is polynomially recognizable. (Q2248321) (← links)
- Dualizability of automatic algebras. (Q2436718) (← links)
- On varieties of flat nil-semirings (Q2684026) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS (Q3502845) (← links)
- EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM (Q3601326) (← links)
- The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419) (← links)
- THE MEMBERSHIP PROBLEM IN FINITE FLAT HYPERGRAPH ALGEBRAS (Q5297220) (← links)
- Flat algebras and the translation of universal Horn logic to equational logic (Q5387303) (← links)
- INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS (Q5470161) (← links)
- Finite bases for flat graph algebras (Q5956274) (← links)
