Sentiment classification via improved feature selection using Boolean operator-based particle swarm optimization. [PDF]
Sci RepSharma HD +6 more
europepmc +1 more source
Machine learning-enabled inverse design of bioinspired layered composite structures with maximum auxetic performance. [PDF]
Commun EngLi Y +9 more
europepmc +1 more source
Fault Diagnosis and Location Method for Stator-Winding Single-Phase Grounding of Large Generator Based on Stepped-Frequency Pulse Injection. [PDF]
Sensors (Basel)Lei B +7 more
europepmc +1 more source
Corneoscleral Morphology in Keratoconus and Its Association With Corneal Tomography and Biomechanics. [PDF]
Transl Vis Sci TechnolRuan W +6 more
europepmc +1 more source
Non-commutative L p spaces and Grassmann stochastic analysis. [PDF]
Probab Theory Relat FieldsDe Vecchi F +3 more
europepmc +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.
Michael Aschbacher
openalex +4 more sources
Classification of maximal subgroups of odd index in finite simple classical groups
Proceedings of the Steklov Institute of Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Н. В. Маслова
openalex +2 more sources
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
openalex +2 more sources