A Combinatorial Algorithm for Pfaffians

  title={A Combinatorial Algorithm for Pfaffians},
  author={Meena Mahajan and P. R. Subramanya and V. Vinay},
  booktitle={Electronic Colloquium on Computational Complexity},
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing Pfaffians. We present the first completely combinatorial algorithm for computing the Pfaffian in polynomial time. Our algorithm works over arbitrary commutative rings. Over integers, we show that it can be computed in the complexity… CONTINUE READING
10 Citations
16 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 16 references

Graph Theory and Crystal Physics

  • P. W. Kasteleyn
  • Graph Theory and Theoretical Physics, ed: F…
  • 1967
Highly Influential
12 Excerpts


  • E. Allender, K. Reinhardt
  • Matching, and Counting, in IEEE Conference on…
  • 1998
2 Excerpts

Why is boolean complexity theory difficult? In M

  • L. G. Valiant
  • S. Paterson, editor, Boolean Function Complexity…
  • 1992


  • C. Damm
  • Technical Report Informatik–Preprint 8…
  • 1991


  • V. V
  • NC algorithms for computing the number of perfect…
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…