Mikhail Slabodkin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The resolution complexity of the perfect matching principle was studied by Razborov [Raz04], who developed a technique for proving its lower bounds for dense graphs. We construct a a constant degree bipartite graph G n such that the resolution complexity of the perfect matching principle for G n is 2 Ω(n) , where n is the number of vertices in G n. This(More)
  • 1