This project focuses on the development of efficient algorithms for finite classical groups, which often serve as basic building blocks for more general matrix groups. Our goal is to design a new algorithm that takes as input a classical group without any assumptions about its computer representation and computes a data structure essential for further analysis. Additionally, we aim to provide further sophisticated algorithms in group theory. Our algorithms are randomized and are accompanied by success probabilities and a detailed complexity analysis. Everything will be implemented in the computer algebra system OSCAR.
