Polynomial-Time Under-Approximation of Winning Regions in Parity Games.
Adam AntonikNathaniel CharltonMichael HuthPublished in: Electron. Notes Theor. Comput. Sci. (2009)
Keyphrases
- approximation algorithms
- approximation ratio
- computational complexity
- piecewise constant
- polynomial time approximation
- human players
- special case
- game design
- constant factor approximation algorithm
- integrality gap
- error bounds
- closed form
- game theory
- image regions
- np hard
- video games
- region of interest
- serious games
- error correction
- human computation
- keypoints
- color images
- decision trees