My Ph.D. student, Ariel Fernández, has successfully defended his thesis on June 10, 2013: Formalizing Combinatorial Matrix Theory.
The results of that thesis were presented at two conferences:
- Ariel Fernández and Michael Soltys, Feasible combinatorial matrix theory, 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 8087 of Lecture Notes in Computer Science, pages 777-788, IST, Klosterneuburg, Austria, August 2013. Click here for an expanded proof of Claim in the paper. [doi][slides]
- Ariel Fernández and Michael Soltys, Feasible combinatorial matrix theory: polytime proofs for König’s Min-Max and related theorems, short presentation at LICS 2013. [slides][full version]