Results 201 to 210 of about 16,282 (247)

Computational complexity and the classification of finite simple groups

24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 1983
We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main results are these: A1. A polynomial time algorithm to test simplicity and find composition factors of a given permutation group (COMP). A2.
László Babai   +2 more
openaire   +1 more source

The Classification of the Finite Simple Groups

The Mathematical Intelligencer, 1980
This article on the classification of finite simple groups is directed towards a broad audience. The author poses some natural questions connected with finite groups and in particular with finite simple groups. He explains in a lucid way why these questions have particular answers.
openaire   +3 more sources

Home - About - Disclaimer - Privacy