In: 32nd Computational Complexity Conference, CCC 2017 Leibniz International Proceedings in Informatics, LIPIcs (79) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 30:1-30:24. ISSN 1868-8969
On the polynomial parity argument complexity of the combinatorial nullstellensatz
ANNALS OF OPERATIONS RESEARCH, 253 (1)., pp. 707-708. ISSN 0254-5330
Two short proofs regarding the logarithmic least squares optimality in Chen, K., Kou, G., Tarn, J. M., Song, Y. (2015): Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices