Join Our Newsletter

STACS

2001

Springer

10 years 5 months ago
2001

Springer

Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

It is well known that ﬁnite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for inﬁnite matrices under suitable restrictions. One can use t...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...

STACS

2001

Springer

10 years 5 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...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

Abstract. We consider a collection of robots which are identical (anonymous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they a...

STACS

2001

Springer

10 years 5 months ago
2001

Springer

We study eﬀectively given positive reals (more speciﬁcally, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...