Fast randomized algorithms for the structure of matrix algebras over finite fields
Ivanyos, Gábor (2000) Fast randomized algorithms for the structure of matrix algebras over finite fields. In: ISSAC 2000. International symposium on symbolic and algebraic computation. St. Andrews, 2000..
Full text not available from this repository.| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Artificial Intelligence Laboratory |
| Depositing User: | Eszter Nagy |
| Date Deposited: | 11 Dec 2012 15:06 |
| Last Modified: | 11 Dec 2012 15:06 |
| URI: | https://eprints.sztaki.hu/id/eprint/2307 |
![]() |
Update Item |



