Unambiguous Computations and Locally Definable Acceptance Types

Abstract 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 MOD Z k P . It is shown 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 ▽P. UAP (and thus ▽P) contains Few and is currently the smallest class known with this property.

[1]  Stuart A. Kurtz,et al.  Gap-Definable Counting Classes , 1994, J. Comput. Syst. Sci..

[2]  Pierluigi Crescenzi,et al.  A Uniform Approach to Define Complexity Classes , 1992, Theor. Comput. Sci..

[3]  Rolf Niedermeier,et al.  Extended Locally Definable Acceptance Types (Extended Abstract) , 1993, STACS.

[4]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[5]  Ian Parberry,et al.  On the Construction of Parallel Computers from Various Bases of Boolean Functions , 1986, Theor. Comput. Sci..

[6]  Rolf Niedermeier,et al.  Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits , 1995, Inf. Comput..

[7]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[8]  Bernd Borchert,et al.  Predicate classes and promise classes , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[9]  Uwe Schöning,et al.  Robust Algorithms: A Different Approach to Oracles , 1985, Theor. Comput. Sci..

[10]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[11]  Stephen A. Fenner,et al.  Gap-deenable Counting Classes , 1991 .

[12]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[13]  Ulrich Hertrampf.  Locally Definable Acceptance Types for Polynomial Time Machines , 1992, STACS.

[14]  Ronald V. Book.  What is Structural Complexity Theory , 1989 .

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[16]  Denis Thérien,et al.  Logspace and Logtime Leaf Languages , 1996, Inf. Comput..

[17]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[18]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1986, Theor. Comput. Sci..

[19]  Jin-Yi Cai,et al.  Promise Problems and Access to Unambiguous Computation , 1992, MFCS.

[20]  Pierluigi Crescenzi,et al.  Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.

[21]  Ulrich Hertrampf.  Locally Definable Acceptance Types - The Three-Valued Case , 1992, LATIN.

[22]  A. Stephen,et al.  Gap-De nable Counting Classes , 1991 .

[23]  Juris Hartmanis,et al.  Robust Machines Accept Easy Sets , 1990, Theor. Comput. Sci..

[24]  Thomas Schwentick,et al.  On the power of polynomial time bit-reductions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[25]  Peter Rossmanith,et al.  Unambiguous polynomial hierarchies and exponential size , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[26]  Lane A. Hemaspaandra,et al.  Using Inductive Counting to Simulate Nondeterministic Computation , 1990, MFCS.

[27]  Klaus-Jörn Lange,et al.  Unambiguity of circuits , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[28]  Ulrich Hertrampf.  Complexity classes defined via k-valued functions , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[29]  Jin-Yi Cai,et al.  On the Power of Parity Polynomial Time , 1989, STACS.

[30]  John Gill,et al.  Counting Classes: Thresholds, Parity, Mods, and Fewness , 1990, Theor. Comput. Sci..

[31]  Eric Allender,et al.  The Complexity of Sparse Sets in P , 1986, SCT.