scientific article; zbMATH DE number 7288618
From MaRDI portal
Publication:5141616
Thomas Brihaye, Florent Delgrange, Mickael Randour, Youssouf Oualhadj
Publication date: 18 December 2020
Full work available at URL: https://arxiv.org/abs/1901.03571
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Trading performance for stability in Markov decision processes
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- The complexity of membership problems for circuits over sets of integers
- Number of quantifiers is better than number of tape cells
- Looking at mean payoff through foggy windows
- Reasoning about cost-utility constraints in probabilistic models
- Multi-cost bounded reachability in MDP
- Looking at mean-payoff and total-payoff through windows
- Reachability in two-clock timed automata is PSPACE-complete
- Finitary winning in ω-regular games
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- PP is as Hard as the Polynomial-Time Hierarchy
- The Odds of Staying on Budget
- Eager Markov Chains
- Games through Nested Fixpoints
- On the menbership problem for functional and multivalued dependencies in relational databases
- A note on the complexity of cryptography (Corresp.)
- Weight monitoring with linear temporal logic
- Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
- Variations on the Stochastic Shortest Path Problem
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
- Percentile queries in multi-dimensional Markov decision processes
This page was built for publication:
