Bipartite Perfect Matching is in Quasi-NC
2019
We show that the bipartite perfect matching problem is in quasi-$\mathsf{NC}^2$. That is, it has uniform circuits of quasi-polynomial size $n^{O(\log n)}$, and $O(\log^2 n)$ depth. Previously, only...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
22
References
3
Citations
NaN
KQI