Skip to search formSkip to main content

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

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

2017

2017

Abstract In Shu and Lin, 2011, exponential time (actually polynomial space) algorithms for determining the weak detectability and… Expand

Is this relevant?

2015

2015

Known to be decidable since 1981, there still remains a huge gap between the best known lower and upper bounds for the reach… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Abstract Given an arbitrary position of the Othello game played on an n × n board, the problem of determining the winner is shown… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e… Expand

Is this relevant?

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

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Abstract We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be… Expand

Is this relevant?