The Odds of Staying on Budget
DOI10.1007/978-3-662-47666-6_19zbMath1440.68119arXiv1409.8228OpenAlexW1795375859MaRDI QIDQ3449479
Stefan Kiefer, Christoph Haase
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8228
Analysis of algorithms and problem complexity (68Q25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov and semi-Markov decision processes (90C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of membership problems for circuits over sets of integers
- The complexity of the \(K\)th largest subset problem and related problems
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- PP is as Hard as the Polynomial-Time Hierarchy
- The Odds of Staying on Budget
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- On the Complexity of Numerical Analysis
- Computational Complexity of Probabilistic Turing Machines
- Trade-off analysis meets probabilistic model checking
- Computing Quantiles in Markov Reward Models
- Variations on the Stochastic Shortest Path Problem
- Foundations of Software Science and Computational Structures
- Percentile queries in multi-dimensional Markov decision processes
This page was built for publication: The Odds of Staying on Budget
