Year of Publication
Nondeterminism is typically used as an inherent part of the computational models used incomputational complexity. However, much work has been done looking at nondeterminism asa separate resource added to deterministic machines. This survey examines several differentapproaches to limiting the amount of nondeterminism, including Kintala and Fischer's Î²hierarchy, and Cai and Chen's guess-and-check model.
Levy, Matthew Asher, "A SURVEY OF LIMITED NONDETERMINISM IN COMPUTATIONAL COMPLEXITY THEORY" (2003). University of Kentucky Master's Theses. 221.