All superlinear inverse schemes are coNP-hard

Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. All superlinear inverse schemes are coNP-hard. Theoretical Computer Science, 345(2-3):345-358, 2005. [doi]

@article{HemaspaandraHH05,
  title = {All superlinear inverse schemes are coNP-hard},
  author = {Edith Hemaspaandra and Lane A. Hemaspaandra and Harald Hempel},
  year = {2005},
  doi = {10.1016/j.tcs.2005.07.015},
  url = {http://dx.doi.org/10.1016/j.tcs.2005.07.015},
  researchr = {https://researchr.org/publication/HemaspaandraHH05},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {345},
  number = {2-3},
  pages = {345-358},
}