Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs

The complexity of computing the permanent

Leslie G. Valiant · Theoretical Computer Science · 1979 · 2.8K citations

Computing, Computer Science, Mathematics +9

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 659 citations

Computing, Computer Science, Artificial Intelligence +4

Graph theory and theoretical physics

Frank Harary · 1967 · 613 citations

Natural Sciences, Mathematics, Physics +12

Matching is as easy as matrix inversion

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

Computing, Computer Science, Algorithms +7

Constructing a perfect matching is in random NC

Richard M. Karp, Eli Upfal, Avi Wigderson · COMBINATORICA · 1986 · 254 citations

Natural Sciences, Computer Science, Mathematics +6