Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

A P system is a natural computing model inspired by information processing in cells and cellular membranes. We show that… Expand

Highly Cited

2005

Highly Cited

2005

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… Expand

Highly Cited

2005

Highly Cited

2005

Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions… Expand

Highly Cited

2004

Highly Cited

2004

We prove that satisfiability problem for word equations is in PSPACE.

Highly Cited

1998

Highly Cited

1998

We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs… Expand

Highly Cited

1997

Highly Cited

1997

It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata ((nite tape Turing Machine (TM)). In… Expand

Highly Cited

1992

Highly Cited

1992

In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in… Expand

Highly Cited

1988

Highly Cited

1988

We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial… Expand

Highly Cited

1979

Highly Cited

1979

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

Highly Cited

1978

Highly Cited

1978

The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand