Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > EDMONDS PROBLEM:
Reports tagged with Edmonds problem:
TR13-103 | 24th July 2013
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha

#### Generalized Wong sequences and their applications to Edmonds' problems

We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix $M$ whose entries are homogeneous linear polynomials over the integers. Given a linear subspace $\mathcal{B}$ of the $n \times n$ matrices over some field $\mathbb{F}$, we consider ... more >>>

ISSN 1433-8092 | Imprint