×

Found 515 Documents (Results 1–100)

The complexity of checking the polynomial completeness of finite quasigroups. (English. Russian original) Zbl 1437.20052

Discrete Math. Appl. 30, No. 3, 169-175 (2020); translation from Diskretn. Mat. 30, No. 4, 3-11 (2018).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of the Cayley semigroup membership problem. (English) Zbl 1441.68090

Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 25, 12 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field