We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
We take a fresh look at the problem of how to check safety properties of finite state machines. We are particularly interested in checking safety properties with the help of a SAT-...
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an a...