O(n² + n^ω)-time algorithm decides if branch-width of a matrix-represented matroid over a finite field is at most k.
Ibarra, Shlomo Moran, and Roger Hui, A generalization of the fast LUP matrix decomposition algorithm and applications , J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Branch-width of represented matroids in matrix multiplication time
O(n² + n^ω)-time algorithm decides if branch-width of a matrix-represented matroid over a finite field is at most k.