All Superlinear Inverse Schemes Are coNP-Hard

Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. All Superlinear Inverse Schemes Are coNP-Hard. In Jirí Fiala, Václav Koubek, Jan Kratochvíl, editors, Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Volume 3153 of Lecture Notes in Computer Science, pages 368-379, Springer, 2004. [doi]

Abstract

Abstract is missing.