Distinguishing bounded reducibilities by sparse sets

Ker-I Ko. Distinguishing bounded reducibilities by sparse sets. In Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988. pages 181-191, IEEE Computer Society, 1988. [doi]

@inproceedings{Ko88a,
  title = {Distinguishing bounded reducibilities by sparse sets},
  author = {Ker-I Ko},
  year = {1988},
  doi = {10.1109/SCT.1988.5278},
  url = {http://dx.doi.org/10.1109/SCT.1988.5278},
  researchr = {https://researchr.org/publication/Ko88a},
  cites = {0},
  citedby = {0},
  pages = {181-191},
  booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-0794-7},
}