One query reducibilities between partial information classes

Sebastian Bab, Arfst Nickelsen. One query reducibilities between partial information classes. Theoretical Computer Science, 345(2-3):173-189, 2005. [doi]

@article{BabN05,
  title = {One query reducibilities between partial information classes},
  author = {Sebastian Bab and Arfst Nickelsen},
  year = {2005},
  doi = {10.1016/j.tcs.2005.07.006},
  url = {http://dx.doi.org/10.1016/j.tcs.2005.07.006},
  researchr = {https://researchr.org/publication/BabN05},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {345},
  number = {2-3},
  pages = {173-189},
}