Author:
Babai L.,Goodman A.J.,Kantor W.M.,Luks E.M.,Pálfy P.P.
Subject
Algebra and Number Theory
Reference25 articles.
1. L. M. Adleman, H. W. Lenstra, Finding irreducible polynomials over finite fields, Proceedings of the ACM Symposium on Theory of Computing, Berkeley, 1986, 350, 355
2. L. Babai, 1991, Computational complexity in finite groups, Proceedings of the International Congress of Mathematicians, Kyoto, 1990, 1479, 1489, Springer-Verlag, Tokyo
3. Bounded round interactive proofs in finite groups;Babai;SIAM J. Discrete Math.,1992
4. Randomization in group algorithms: conceptual questions;Babai,1997
5. L. Babai, E. Szemerédi, On the complexity of matrix group problems I, Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, Palm Beach, FL, 1984, 229, 240
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献