Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > AAYUSH OJHA:
All reports by Author Aayush Ojha:

TR18-004 | 3rd January 2018
Aayush Ojha, Raghunath Tewari

Circuit Complexity of Bounded Planar Cutwidth Graph Matching

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 this paper, we disprove their conjecture by showing that the problem is
not in AC^0[p^{\alpha}] for every prime p. ... more >>>




ISSN 1433-8092 | Imprint