On the computation of pfaffians

DOI10.1016/0166-218X(92)00034-JzbMath0811.68083WikidataQ127334801 ScholiaQ127334801MaRDI QIDQ1329786

Giulia Galbiati, Francesco Maffioli

Publication date: 31 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matchingmatroid theory

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (7)

The combinatorial approach yields an NC algorithm for computing Pfaffians ⋮ New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ Counting the number of perfect matchings in \(K_{5}\)-free graphs ⋮ Random pseudo-polynomial algorithms for some combinatorial programming problems ⋮ An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem ⋮ Randomized algorithms over finite fields for the exact parity base problem.

Cites Work

• Matching theory
• Random pseudo-polynomial algorithms for exact matroid problems
• Systems of distinct representatives and linear algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computation of pfaffians