The complexity of checking the polynomial completeness of finite quasigroups.
| Autor: | Galatenko, Aleksey V., Pankratiev, Anton E. |
|---|---|
| Předmět: | |
| Zdroj: | Discrete Mathematics & Applications; Jun2020, Vol. 30 Issue 3, p169-175, 7p |
| Abstrakt: | The 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. [ABSTRACT FROM AUTHOR] |
| Databáze: | Complementary Index |
| Externí odkaz: |
|