Semantic Scholar uses AI to extract papers important to this topic.
A P system is a natural computing model inspired by information processing in cells and cellular membranes. We show that… Expand We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… Expand Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions… Expand
We prove that satisfiability problem for word equations is in PSPACE.
We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs… Expand It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata ((nite tape Turing Machine (TM)). In… Expand In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in… Expand We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial… Expand Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in… Expand The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand