Back to Results
First PageMeta Content
NP-complete problems / Matching / Clique problem / Independent set / Minimum spanning tree / Computing the permanent / Interval graph / Factor-critical graph / Bipartite graph / Graph theory / Mathematics / Theoretical computer science


Matching is as Easy as Matrix Inversion Ketan Mulmuley ’ Computer Science Department University of California, Berkeley Umesh V. Vazirani 2
Add to Reading List

Document Date: 2004-09-11 21:07:28


Open Document

File Size: 830,48 KB

Share Result on Facebook
UPDATE