| 2008 |
|---|
| 12 | EE | Grzegorz Herman,
Michael Soltys:
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
CoRR abs/0811.3959: (2008) |
| 11 | EE | David Bremner,
Antoine Deza,
Michael Soltys:
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.
J. Comb. Optim. 16(4): 323 (2008) |
| 2007 |
|---|
| 10 | EE | Michael Soltys:
The proof theoretic strength of the Steinitz exchange theorem.
Discrete Applied Mathematics 155(1): 53-60 (2007) |
| 9 | EE | Grzegorz Herman,
Tim Paterson,
Michael Soltys:
A Propositional Proof System with Quantification Over Permutations.
Fundam. Inform. 79(1-2): 71-83 (2007) |
| 2005 |
|---|
| 8 | EE | Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm.
CSL 2005: 493-508 |
| 7 | EE | Neil Thapen,
Michael Soltys:
Weak theories of linear algebra.
Arch. Math. Log. 44(2): 195-208 (2005) |
| 6 | EE | Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm
CoRR abs/cs/0505087: (2005) |
| 5 | EE | Michael Soltys:
LA, permutations, and the Hajós Calculus.
Theor. Comput. Sci. 348(2-3): 321-333 (2005) |
| 2004 |
|---|
| 4 | EE | Michael Soltys:
LA, Permutations, and the Hajós Calculus.
ICALP 2004: 1176-1187 |
| 3 | EE | Michael Soltys,
Stephen A. Cook:
The proof complexity of linear algebra.
Ann. Pure Appl. Logic 130(1-3): 277-323 (2004) |
| 2 | EE | Michael Soltys,
Alasdair Urquhart:
Matrix identities and the pigeonhole principle.
Arch. Math. Log. 43(3): 351-358 (2004) |
| 2002 |
|---|
| 1 | EE | Michael Soltys,
Stephen A. Cook:
The Proof Complexity of Linear Algebra.
LICS 2002: 335-344 |
