Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

DOI10.1007/978-3-642-45030-3_43zbMath1406.68040OpenAlexW803684435MaRDI QIDQ2872110

Peter Bro Miltersen, Søren Kristoffer Stiil Frederiksen

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial games (91A46)

Related Items (2)

Symbolic Model Checking in Non-Boolean Domains ⋮ Unnamed Item

This page was built for publication: Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy