Black Box Classical Groups
By William M. Kantor, Á. Seress. 2001
100 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/b2846b96f4e19221c3a19fc8e67c148383d47a84
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Electrical and Electronic Engineering
In Mathematical Physics
Citations in the corpus
- Constructive recognition of classical groups in even characteristic (2009, background): “Kantor & Seress [26] have developed black-box constructive recognition algorithms (see [36, p.”
- WHAT DO WE KNOW ABOUT THE PRODUCT REPLACEMENT ALGORITHM (2009, background): “[BrP,Kn2, KS ,NP1]). Let us show that they are useless in case of powers of An.”
- Involutions in groups of finite Morley rank of degenerate type (2007, background): “One of the main ingredients comes from an unusual source: “black box group theory” [ KS00 ], via a line of thought represented by [Br00, AlBo01, Bo02].”