Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov. Resolution complexity of perfect mathcing principles for sparse graphs. Electronic Colloquium on Computational Complexity (ECCC), 21:93, 2014. [doi]
@article{ItsyksonSS14,
title = {Resolution complexity of perfect mathcing principles for sparse graphs},
author = {Dmitry Itsykson and Mikhail Slabodkin and Dmitry Sokolov},
year = {2014},
url = {http://eccc.hpi-web.de/report/2014/093},
researchr = {https://researchr.org/publication/ItsyksonSS14},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {21},
pages = {93},
}