Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

Gavin Harrison, Jeremy R. Johnson, B. David Saunders. Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. ACM Comm. Computer Algebra, 47(3/4):118-119, 2013. [doi]

@article{HarrisonJS13,
  title = {Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation},
  author = {Gavin Harrison and Jeremy R. Johnson and B. David Saunders},
  year = {2013},
  doi = {10.1145/2576802.2576822},
  url = {http://doi.acm.org/10.1145/2576802.2576822},
  researchr = {https://researchr.org/publication/HarrisonJS13},
  cites = {0},
  citedby = {0},
  journal = {ACM Comm. Computer Algebra},
  volume = {47},
  number = {3/4},
  pages = {118-119},
}