Mikhail Slabodkin
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Tight lower bounds on the resolution complexity of perfect matching principles Fundamenta Informaticae | 2017-07-28 | Paper |
| Resolution complexity of perfect matching principles for sparse graphs Lecture Notes in Computer Science | 2015-10-20 | Paper |
Research outcomes over time
This page was built for person: Mikhail Slabodkin
