On the computation of pfaffians
From MaRDI portal
Publication:1329786
DOI10.1016/0166-218X(92)00034-JzbMATH Open0811.68083WikidataQ127334801 ScholiaQ127334801MaRDI QIDQ1329786FDOQ1329786
Authors: Giulia Galbiati, Francesco Maffioli 
Publication date: 31 July 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Publication:4938661
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Faster combinatorial algorithms for determinant and Pfaffian
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
Hermitian, skew-Hermitian, and related matrices (15B57) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (14)
- The Faddeev-LeVerrier algorithm and the Pfaffian
- Title not available (Why is that?)
- Optimized implementation for calculation and fast-update of Pfaffians installed to the open-source fermionic variational solver mVMC
- Faster combinatorial algorithms for determinant and Pfaffian
- New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Enumeration of even and odd chord diagrams
- Algorithm 923: Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
- Random pseudo-polynomial algorithms for some combinatorial programming problems
- A factorization algorithm to compute Pfaffians
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- Counting the number of perfect matchings in \(K_{5}\)-free graphs
- Randomized algorithms over finite fields for the exact parity base problem.
This page was built for publication: On the computation of pfaffians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329786)
