Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,713,581 papers from all fields of science

Search

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

Highly Cited

2005

Highly Cited

2005

Recently, it has been shown that the small DL EL, which allows for conjunction and existential restrictions, has better…

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…

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…

Highly Cited

1994

Highly Cited

1994

Highly Cited

1994

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…

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…

Highly Cited

1987

Highly Cited

1982

Highly Cited

1982

We define the set of planar boolean formulae, and then show that the set of true quantified planar formulae is polynomial space…

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…