Pages that link to "Item:Q3990608"
From MaRDI portal
The following pages link to Random pseudo-polynomial algorithms for exact matroid problems (Q3990608):
Displayed 12 items.
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Polymatroids: Construction and random algorithms (Q1179434) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- Random pseudo-polynomial algorithms for some combinatorial programming problems (Q1194734) (← links)
- On the computation of pfaffians (Q1329786) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems (Q1906282) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- On the difficulty of finding walks of length k (Q4385673) (← links)