
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices
We investigate the complexity of computing the Zariski closure of a fini...
read it

Transience in Countable MDPs
The Transience objective is not to visit any state infinitely often. Whi...
read it

Cyclotomic Identity Testing and Applications
We consider the cyclotomic identity testing (CIT) problem: given a polyn...
read it

Strategy Complexity of Parity Objectives in Countable MDPs
We study countably infinite MDPs with parity objectives. Unlike in finit...
read it

Controlling a Random Population is EXPTIMEhard
Bertrand et al. [1] (LMCS 2019) describe twoplayer zerosum games in wh...
read it

Coverability in 1VASS with Disequality Tests
We show that the controlstate reachability problem for onedimensional ...
read it

On the Complexity of Value Iteration
Value iteration is a fundamental algorithm for solving Markov Decision P...
read it

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes
We study the complexity of evaluating powered functions implemented by s...
read it

Costs and Rewards in Priced Timed Automata
We consider Pareto analysis of reachable states of multipriced timed au...
read it
Mahsa Shirmohammadi
is this you? claim profile