2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.CC2008
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Grzegorz Herman, Michael Soltys
Although a deterministic polytime algorithm for primality testing is now known, the Rabin-Miller randomized test of primality continues being the most efficient and widely used alg…
cs.LO2005★ 2 cited
Feasible Proofs of Matrix Properties with Csanky's Algorithm
Michael Soltys
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP…
math.RA2002
Berkowitz's Algorithm and Clow Sequences
Michael Soltys
We present a combinatorial interpretation of Berkowitz's algorithm. Berkowitz's algorithm is the fastest known parallel algorithm for computing the characteristic polynomial of a m…