Resolution complexity of perfect mathcing principles for sparse graphs

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]

Authors

Dmitry Itsykson

This author has not been identified. Look up 'Dmitry Itsykson' in Google

Mikhail Slabodkin

This author has not been identified. Look up 'Mikhail Slabodkin' in Google

Dmitry Sokolov

This author has not been identified. Look up 'Dmitry Sokolov' in Google