Pages that link to "Item:Q1887034"
From MaRDI portal
The following pages link to The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034):
Displaying 6 items.
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- The Faddeev-LeVerrier algorithm and the Pfaffian (Q820990) (← links)
- Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)
