Shankar Kalyanaraman, Christopher Umans. The Complexity of Rationalizing Matchings. Electronic Colloquium on Computational Complexity (ECCC), 15(021), 2008. [doi]
@article{KalyanaramanU08:0,
title = {The Complexity of Rationalizing Matchings},
author = {Shankar Kalyanaraman and Christopher Umans},
year = {2008},
url = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-021/index.html},
researchr = {https://researchr.org/publication/KalyanaramanU08%3A0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {15},
number = {021},
}