The complexity of checking the polynomial completeness of finite quasigroups

Autor:	A. E. Pankratiev, Aleksey V. Galatenko
Rok vydání:	2020
Předmět:	Discrete mathematics Polynomial 010201 computation theory & mathematics Applied Mathematics Completeness (order theory) 010102 general mathematics Discrete Mathematics and Combinatorics 0102 computer and information sciences 0101 mathematics 01 natural sciences Mathematics
Zdroj:	Discrete Mathematics and Applications. 30:169-175
ISSN:	1569-3929 0924-9265
DOI:	10.1515/dma-2020-0016
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7ea771db80ba60d16750a58bedbf2032 https://doi.org/10.1515/dma-2020-0016 Zobrazit plný text záznamu