Christos Papadimitriou. Games against nature. Journal of Computer and System Sciences, 31:288--301, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Interactive Foundations of Computing - Wegner (1997) (32 citations) (Correct)
....be described by algorithms (see section 6) Two person games model a form of interactive computing that has been extensively studied for both process models [Mil] and on line algorithms. The result that games against nature with a polynomial number of moves have Pspace algorithmic complexity [Pa] illustrates that interactive complexity, defined by the number of interactive steps, can be dramatically less than algorithmic complexity. Games against nature need an oracle to realize polynomial interactive complexity. However, for problems (like driving) in which local interactive responses ....
Christos Papadimitriou, Games Against Nature, Journal of Computer and System Sciences, 31 (288301) , 1985.
Tetris is Hard, Even to Approximate - Demaine, Hohenberger, Liben-Nowell (2003) (Correct)
No context found.
Christos Papadimitriou. Games against nature. Journal of Computer and System Sciences, 31:288--301, 1985.
Tetris is Hard, Even to Approximate - Breukelaar, Demaine, Hohenberger.. (Correct)
No context found.
Christos Papadimitriou. Games against nature. Journal of Computer and System Sciences, 31:288--301, 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC