打折
发表于 2025-3-28 18:27:30
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.
证明无罪
发表于 2025-3-28 22:29:10
http://reply.papertrans.cn/83/8219/821819/821819_42.png
下级
发表于 2025-3-29 02:06:35
http://reply.papertrans.cn/83/8219/821819/821819_43.png
填满
发表于 2025-3-29 06:48:20
http://reply.papertrans.cn/83/8219/821819/821819_44.png
PLAYS
发表于 2025-3-29 07:35:19
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
发表于 2025-3-29 14:12:42
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
发表于 2025-3-29 17:52:30
http://reply.papertrans.cn/83/8219/821819/821819_47.png
坚毅
发表于 2025-3-29 22:19:34
http://reply.papertrans.cn/83/8219/821819/821819_48.png
BARB
发表于 2025-3-30 02:30:17
http://reply.papertrans.cn/83/8219/821819/821819_49.png