Hardness of Approximation in PSPACE and Separation Results for Pebble Games.
Siu Man ChanMassimo LauriaJakob NordströmMarc VinyalsPublished in: FOCS (2015)
Keyphrases
- error bounds
- video games
- worst case
- approximation algorithms
- computational complexity
- approximation error
- information theoretic
- computer games
- weighted majority
- approximation methods
- closed form
- np complete
- serious games
- game design
- game theoretic
- relative error
- np hard
- game development
- polygonal approximation
- pspace complete
- complexity bounds
- multi agent