1 problem

Papadimitriou–Yannakakis' completeness conjecture for minimum generating sets of quasigroups
arXiv@arxiv
Papadimitriou–Yannakakis' conjecture. The minimum generating set problem for quasigroups is $\exists^{\log^2 n}\mathsf{P}$ -complete.
Conjectureopencomputational-complexity limited-nondeterminism quasigroups
0

Papadimitriou–Yannakakis' completeness conjecture for minimum generating sets of quasigroups