The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem-Reference-Cited by-同舟云学术

The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

Published:2006 Issue: Volume: Page:233-242
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Arvind V.,Torán Jacobo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11940128_25.pdf

Reference22 articles.

1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)

2. Arvind, V., Kurur, P.P.: Graph Isomorphism is in SPP. Information and Computation 204(5), 835–852 (2006)

3. Arvind, V., Torán, J.: Solvable Group Isomorphism is (almost) in NP ∩ coNP. In: Proc. 19th IEEE Computational Complexity Conference Conference, pp. 91–103 (2004)

4. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. In: EATCS Monographs on Theoretical Computer Science, Springer, Heidelberg (1989)

5. Babai, L.: Trading group theory for randomness. In: Proc. 17th ACM Symposium on Theory of Computing, pp. 421–429 (1985)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constant Depth Circuit Complexity for Generating Quasigroups;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Linear Space Data Structures for Finite Groups with Constant Query-Time;Algorithmica;2024-03-11

3. Compact Data Structures for Dedekind Groups and Finite Rings;WALCOM: Algorithms and Computation;2021

4. Random ubiquitous transformation semigroups;Semigroup Forum;2019-01-22

5. Graph Isomorphism is Not AC0-Reducible to Group Isomorphism;ACM Transactions on Computation Theory;2013-11