Pages that link to "Item:Q4791998"
From MaRDI portal
The following pages link to COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA (Q4791998):
Displaying 5 items.
- Non-generators in complete lattices and semilattices (Q2151110) (← links)
- Algebraic dependence in generating functions and expansion complexity (Q2176295) (← links)
- The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311114) (← links)
- Computing generating sets of minimal size in finite algebras (Q6108373) (← links)