Matching Is as Easy as Matrix Inversion

Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani. Matching Is as Easy as Matrix Inversion. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA. pages 345-354, ACM, 1987.

@inproceedings{MulmuleyVV87:0,
  title = {Matching Is as Easy as Matrix Inversion},
  author = {Ketan Mulmuley and Umesh V. Vazirani and Vijay V. Vazirani},
  year = {1987},
  researchr = {https://researchr.org/publication/MulmuleyVV87%3A0},
  cites = {0},
  citedby = {0},
  pages = {345-354},
  booktitle = {Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA},
  publisher = {ACM},
}