Mikhail Slabodkin

According to our database, Mikhail Slabodkin authored at least 3 papers between 2014 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2016

Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles.

Dmitry Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitry Sokolov

Fundam. Informaticae, 2016

2015

Resolution Complexity of Perfect Matching Principles for Sparse Graphs.

Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Resolution complexity of perfect mathcing principles for sparse graphs.

Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov

Electron. Colloquium Comput. Complex., 2014