Robuta

https://researchdiscovery.drexel.edu/esploro/outputs/journalArticle/Probabilistic-analysis-of-Wiedemanns-algorithm-for/991019173781204721 Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation - Drexel... Jan 28, 2014 - Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation - Drexel University - Journal article probabilistic analysisminimal polynomialwiedemannalgorithmcomputation https://eprints.sztaki.hu/11147/ Deterministic Q-Learning with Relational Game Theory: Polynomial-Time Convergence to Minimal... q learninggame theorypolynomial timedeterministicrelational