Christopher Umans. On the Complexity and Inapproximability of Shortest Implicant Problems. In Jirí Wiedermann, Peter van Emde Boas, Mogens Nielsen, editors, Automata, Languages and Programming, 26th International Colloquium, ICALP 99, Prague, Czech Republic, July 11-15, 1999, Proceedings. Volume 1644 of Lecture Notes in Computer Science, pages 687-696, Springer, 1999. [doi]
@inproceedings{Umans99:0,
title = {On the Complexity and Inapproximability of Shortest Implicant Problems},
author = {Christopher Umans},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1644/16440687.htm},
researchr = {https://researchr.org/publication/Umans99%3A0},
cites = {0},
citedby = {0},
pages = {687-696},
booktitle = {Automata, Languages and Programming, 26th International Colloquium, ICALP 99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
editor = {Jirí Wiedermann and Peter van Emde Boas and Mogens Nielsen},
volume = {1644},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66224-3},
}