Gaya APA
Wang, Mengdi. ().
Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time .
:
.
Gaya Chicago
Wang, Mengdi.
Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time.
:
,
.
Text.
Gaya MLA
Wang, Mengdi.
Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time.
:
,
.
Text.
Gaya Turabian
Wang, Mengdi.
Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time.
:
,
.
Print.