Showcasing straight-line programs with memory via matrix Bruhat decomposition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- A data structure for a uniform approach to computations with finite groups
- Black box classical groups.
- Computing in groups of Lie type
- Constructing composition factors for a linear group in polynomial time
- Constructive recognition of classical groups in even characteristic.
- Constructive recognition of classical groups in odd characteristic.
- Generators for Simple Groups
- Presentations on standard generators for classical groups
- Self-indexed Text Compression Using Straight-Line Programs
- Straight-line program length as a parameter for complexity analysis
- The Magma algebra system. I: The user language
- The algebra of elimination
- The computational matrix group project.
- The product replacement prospector.
This page was built for publication: Showcasing straight-line programs with memory via matrix Bruhat decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654581)