Abstract
Motivated by Papadimitriou and Yannakakis' paper on limited nondeterminism [19], we study two questions arising from their work: Quasigroup Isomorphism and the Minimum generating set problem for groups and quasigroups. © 2006 Springer-Verlag Berlin/Heidelberg.
Cite
CITATION STYLE
APA
Arvind, V., & Torán, J. (2006). The complexity of quasigroup isomorphism and the minimum generating set problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 233–242). https://doi.org/10.1007/11940128_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free