Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc. Promise Problems and Guarded Access to Unambiguous Computation. In Klaus Ambos-Spies, Steven Homer, Uwe Schöning, editors, Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992. pages 101-146, Cambridge University Press, 1992.
@inproceedings{CaiHV92,
title = {Promise Problems and Guarded Access to Unambiguous Computation},
author = {Jin-yi Cai and Lane A. Hemachandra and Jozef Vyskoc},
year = {1992},
researchr = {https://researchr.org/publication/CaiHV92},
cites = {0},
citedby = {0},
pages = {101-146},
booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992},
editor = {Klaus Ambos-Spies and Steven Homer and Uwe Schöning},
publisher = {Cambridge University Press},
isbn = {0-521-44220-6},
}