In this paper we obtain complexity bounds for computational problems on
...
Hypergeometric sequences are rational-valued sequences that satisfy
firs...
We study countably infinite stochastic 2-player games with reachability
...
We study the Radical Identity Testing problem (RIT): Given an algebraic
...
We investigate the Membership Problem for hypergeometric sequences: give...
We investigate the complexity of computing the Zariski closure of a fini...
The Transience objective is not to visit any state infinitely often. Whi...
We consider the cyclotomic identity testing (CIT) problem: given a polyn...
We study countably infinite MDPs with parity objectives. Unlike in finit...
Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in wh...
We show that the control-state reachability problem for one-dimensional
...
Value iteration is a fundamental algorithm for solving Markov Decision
P...
We study the complexity of evaluating powered functions implemented by
s...
We consider Pareto analysis of reachable states of multi-priced timed
au...