Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets

Ricard Gavaldà, José L. Balcázar. Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. Theoretical Computer Science, 88(1):1-14, 1991.

@article{GavaldaB91,
  title = {Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets},
  author = {Ricard Gavaldà and José L. Balcázar},
  year = {1991},
  researchr = {https://researchr.org/publication/GavaldaB91},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {88},
  number = {1},
  pages = {1-14},
}