Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera

First Page		Document Content
Date: 2013-12-01 06:17:29 Mathematics Mathematical analysis Mathematical logic Boolean algebra Experiment Measure theory Sigma-algebra Symbol Lie algebras Moschovakis coding lemma Generalised Whitehead product		Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 272,07 KB Share Document on Facebook

	Contractibility + transport ⇔ J Carlo Angiuli December 1, 2014 In MLTT, we usually define the identity type as a reflexive relation satisfying J: Γ`M :A Γ`N :A DocID: 1rsbE - View Document
	Improved approximation for Fr´echet distance on c-packed curves matching conditional lower bounds (extended abstract) Karl Bringmann∗ Marvin K¨ DocID: 1rqIU - View Document
	Herbrand-Confluence for Cut Elimination in Classical First Order Logic Stefan Hetzl1 and Lutz Straßburger2 1 2 DocID: 1rkb2 - View Document
	PDF Document DocID: 1rhd2 - View Document
	661 Documenta Math. Decomposable Cycles and Noether-Lefschetz Loci Kieran G. O’Grady1 DocID: 1r88R - View Document