Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. Some NP-complete problems in linear programming;Chandrasekaran;Oper. Res. Lett.,1982
2. The complexity of three-way statistical tables;De Loera;SIAM J. Comput.,2004
3. A polynomial time algorithm for shaped partition problems;Hwang;SIAM J. Optim.,1999
4. On the maximal matchings of a given weight in complete and complete bipartite graphs;Karzanov;Kibernetika,1987
5. Matching is as easy as matrix inversion;Mulmuley;Combinatorica,1987
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献