L. Babai, W.M. Kantor,and E.M. Luks, Computational complexity and the classification of finite simple groups, Proc. 24th IEEE Symp. Found. Comp. Sci. (1983), 162-171. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Derandomizing Arthur-Merlin Games using Hitting Sets - Miltersen, Variyam (1999) (16 citations) (Correct)
Derandomizing Arthur-Merlin Games using Hitting Sets - Miltersen, Vinodchandran (1999) (16 citations) (Correct)
Sorting with Fixed-Length Reversals - Chen, Skiena (1996) (1 citation) (Correct)
Anchors in Tournaments - Kannan, al. (1992) (Correct)
On Finding the Number of Graph Automorphisms - Robert Beals, Richard Chang.. (1996) (Correct)
Sorting with Fixed-Length Reversals - Chen, Skiena (1995) (1 citation) (Correct)
Graph Nonisomorphism Has Subexponential Size Proofs.. - Klivans, van Melkebeek (1998) (27 citations) (Correct)
Describing Graphs: a First-Order Approach to Graph Canonization - Immerman, Lander (1990) (61 citations) (Correct)
The Isomorphism Testing for Directly Representable Varieties - Tomasz Gora Zd (Correct)
An Optimal Lower Bound on the Number of Variables for.. - Cai, Fürer, Immerman (1992) (86 citations) (Correct)
Computing the Composition Factors of a Permutation Group in.. - Luks (1987) (8 citations) Self-citation (Luks) (Correct)
Polynomial-Time Normalizers for Permutation Groups With.. - Luks, Miyazaki (2002) Self-citation (Luks) (Correct)
Computing in Quotient Groups - Kantor, Luks (1990) (10 citations) Self-citation (Kantor Luks) (Correct)
Reconstructing Simple Group Actions - Kantor, Penttila Self-citation (Kantor) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC