Satoru Iwata, Mizuyo Takamatsu. Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. In Oktay Günlük, Gerhard J. Woeginger, editors, Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings. Volume 6655 of Lecture Notes in Computer Science, pages 274-286, Springer, 2011. [doi]
@inproceedings{IwataT11-0, title = {Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation}, author = {Satoru Iwata and Mizuyo Takamatsu}, year = {2011}, doi = {10.1007/978-3-642-20807-2_22}, url = {http://dx.doi.org/10.1007/978-3-642-20807-2_22}, researchr = {https://researchr.org/publication/IwataT11-0}, cites = {0}, citedby = {0}, pages = {274-286}, booktitle = {Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings}, editor = {Oktay Günlük and Gerhard J. Woeginger}, volume = {6655}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-20806-5}, }