15 search results - page 1 / 3 » stacs 2001 |
STACS
2001
Springer
14 years 29 days ago
2001
Springer
STACS
2001
Springer
14 years 29 days 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
14 years 29 days 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
14 years 29 days ago
2001
Springer
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
STACS
2001
Springer
14 years 29 days 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...