Unambiguous computations and locally definable acceptance types

Rolf Niedermeier, Peter Rossmanith
1998 Theoretical Computer Science  
Hertrampf's locally definable acceptance types show that many complexity classes can be defined in terms of polynomial-time bounded NTMs with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths, etc. We introduce a modification of Hertrampf's locally definable acceptance types which allows to get a larger number of characterizable complexity classes. Among others the newly characterizable classes are UP and MoDZ~P. It is shown
more » ... how different types of oracle access, e.g., guarded access, can be characterized by this model. This sheds new light on the discussion on how to access unambiguous computation. We present simple functions that describe precisely objects of current research as the unambiguous oracle, alternation, and promise hierarchies. We exhibit the new class UAP which seems to be an unambiguous analogue of Wagner's VP. UAP (and thus VP) contains Few and is currently the smallest class known with this property.
doi:10.1016/s0304-3975(97)00005-4 fatcat:c5mxwueohzerrhynsaihw5mmky