The recursive arrival problem

DOI10.4204/EPTCS.390.11MaRDI QIDQ6940530zbMATH OpenFDO

Authors Thomas F. Webster

Publication date 19 August 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.390.11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• scientific article; zbMATH DE number 1796135 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 7650366 (Why is no real title available?)
• ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
• ARRIVAL: next stop in CLS
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Did the train reach its destination: the complexity of finding a witness
• Model Checking Probabilistic Pushdown Automata
• Reachability analysis of pushdown automata: Application to model-checking
• Reachability switching games
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Recursive Markov decision processes and recursive stochastic games
• The complexity of mean payoff games on graphs
• The complexity of stochastic games
• The stochastic arrival problem
• Unique End of Potential Line

This page was built for publication: The recursive arrival problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940530)