Titlebook: Reachability Problems; 17th International C Olivier Bournez,Enrico Formenti,Igor Potapov Conference proceedings 2023 The Editor(s) (if appl

打折

Multi-weighted Reachability Gamese obtained thanks to a fixpoint algorithm which also computes the upper value in polynomial time and the Pareto frontier in exponential time. Finally, the constrained existence problem is proved in . for the lexicographic order and .-complete for the componentwise order.

证明无罪

下级

填满

PLAYS

Quantitative Reachability Stackelberg-Pareto Synthesis Is ,-Completently investigated for .-regular objectives. We solve this problem for weighted graph games and quantitative reachability objectives such that Player 0 wants to reach his target set with a total cost less than some given upper bound. We show that it is .-complete, as for Boolean reachability objectives.

fatuity

On the Complexity of Robust Eventual Inequality Testing for C-Finite Functionsomputational complexity, we develop a natural notion of polynomial-time decidability of subsets of computable metric spaces which extends our recently introduced notion of maximal partial decidability. We show that eventual inequality of C-finite functions is polynomial-time decidable in this sense.

Infant

坚毅

BARB