Space complexity of perfect matching in bounded genus bipartite graphs

Matching is as easy as matrix inversion

Ketan Mulmuley, Umesh Vazirani, Vijay V. Vazirani · 1987 · 626 citations · Full text

Computing, Computer Science, Algorithms +7

Undirected connectivity in log-space

Omer Reingold · Journal of the ACM · 2008 · 511 citations

Computing, Computer Science, Mathematics +16

Towards 3-query locally decodable codes of subexponential length

Sergey Yekhanin · Journal of the ACM · 2008 · 452 citations

Computing, Computer Science, Mathematics +7

Matching is as easy as matrix inversion

Ketan Mulmuley, Umesh Vazirani, Vijay V. Vazirani · COMBINATORICA · 1987 · 386 citations

Computing, Computer Science, Algorithms +7

The graph genus problem is NP-complete

Carsten Thomassen · Journal of Algorithms · 1989 · 259 citations

Natural Sciences, Bioinformatics, Combinatorics +7