An Unambiguous Class Possessing a Complete Set Topics : Computational and Structural Complexity Theory
نویسنده
چکیده
In this work a complete problem for an unambiguous logspace class is presented. This is surprising since unambiguity is a `promise' or`semantic' concept. These usually lead to classes apparently without complete problems.
منابع مشابه
On the Structure of Complete Sets
The many types of resource bounded reductions that are both object of study and research tool in structural complexity theory have given rise to a large variety of completeness notions. A complete set in a complexity class is a manageable object that represents the structure of the entire class. The study of its structure can reveal properties that are general in that complexity class, and the ...
متن کاملMaking Nondeterminism Unambiguous
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly = UL/poly LogCFL/poly = UAuxPDA(logn, n)/poly
متن کاملOn the Development of Emil Post's Ideas in Structural Complexity Theory
Structural complexity theory is one of the branches of computer science. In this survey we will show how notions of a complete r.e. set and many-one reducibility from Post's 1944 paper innuenced the study of NP-complete languages in structural complexity theory.
متن کاملThe Complexity of Deterministically Observable Finite-Horizon Markov Decision Processes
We consider the complexity of the decision problem for diierent types of partially-observable Markov decision processes (MDPs): given an MDP, does there exist a policy with performance > 0? Lower and upper bounds on the complexity of the decision problems are shown in terms of completeness for NL, P, NP, PSPACE, EXP, NEXP or EXPSPACE, dependent on the type of the Markov decision process. For se...
متن کاملA Complete Promise Problem for Statistical Zero-Knowledge
We present a complete promise problem for SZK, the class of languages possessing statistical zero-knowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statisticallyclose or far apart. This characterizes SZK with no reference to interaction or zero-knowledge. From this theorem and its proof, we are able to establish se...
متن کامل