Abstract
AbstractThe complexity of the decision of polynomial (functional) completeness of a finite quasigroup is investigated. It is shown that the polynomial completeness of a finite quasigroup may be checked in time polynomially dependent on the order of the quasigroup.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have