Search papers, labs, and topics across Lattice.
Affiliation:
1
0
2
This work shows that for every fixed rational discount factor ($\gamma\in(0,1)$), exact planning remains NP-hard, and introduces a randomized polynomial-time approximation scheme for every fixed look-ahead depth.
