Circuit Complexity of Bounded Planar Cutwidth Graph Matching

Aayush Ojha, Raghunath Tewari

Recently, perfect matching in bounded planar cutwidth bipartite graphs (\BGGM) was shown to be in ACC${}^0$ by Hansen et al.. They also conjectured that the problem is in AC${}^0$. In…