The computational complexity of deciding whether a finite algebra generates a minimal variety
Crossref DOI link: https://doi.org/10.1007/978-3-319-74772-9_9
Published Online: 2018-03-21
Published Print: 2018
Update policy: https://doi.org/10.1007/springer_crossmark_policy
McNulty, George F.
License valid from 2018-01-01