Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
ICALP, 2015.

ICALP v2 2015
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v2-2015-EtessamiSY,
	author        = "Kousha Etessami and Alistair Stewart and Mihalis Yannakakis",
	booktitle     = "{Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Part II}",
	doi           = "10.1007/978-3-662-47666-6_15",
	isbn          = "978-3-662-47665-9",
	pages         = "184--196",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes}",
	volume        = 9135,
	year          = 2015,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.