Matching is as easy as matrix inversion
- 期刊名称Combinatorica
- 作者Ketan Mulmuley; Umesh V. Vazirani; Vijay V. Vazirani
- 卷第7卷
- 期第1期
- 印刷ISSN0209-9683
- 电子ISSN1439-6912
- 文件大小536.85KB
- 发表时间1987
- DOI10.1007/bf02579206
- 页码105-113
同作者推荐
同期刊推荐
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997