Randomness for free
type: Item
instance of: scholarly article
title: Randomness for free
zbMATH Open document ID: 1333.91008
author: Krishnendu Chatterjee
author: Laurent Doyen
author: Hugo Gimbert
author: Thomas A. Henzinger
published in: Information and Computation
publication date: 2015-12-07T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 6516962
MaRDI profile type: Publication
full work available at URL: j.ic.2015.06.003
OpenAlex ID: W1526407086
cites work: Alternating-time temporal logic
cites work: On Decision Problems for Probabilistic Büchi Automata
cites work: Q4836494
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: POMDPs under probabilistic semantics
cites work: What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
cites work: Partial-Observation Stochastic Games
cites work: Algorithms for Omega-Regular Games with Imperfect Information
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Q5501249
cites work: Computer Science Logic
cites work: Q4473719
cites work: Q3245633
cites work: Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes
cites work: Random Measurable Selections
cites work: Fair simulation
cites work: Q4323294
cites work: The determinacy of Blackwell games
cites work: Infinite games played on finite graphs
cites work: Supervisory Control of a Class of Discrete Event Processes
cites work: The complexity of two-player games of incomplete information
cites work: The complexity of mean payoff games on graphs
DOI: 10.1016/J.IC.2015.06.003
description: scientific article; zbMATH DE number 6516962