7106 search results - page 2 / 1422 » Restricted Complexity, General Complexity |
FOSSACS
2007
Springer
13 years 9 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
STACS
2001
Springer
13 years 10 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...