4934 search results - page 41 / 987 » complexity 2008 |
125
click to vote
CROSSROADS
2007
15 years 2 months ago
2007
We analyze the complexity of the popular PlayStation 2 game, Katamari Damacy. In particular, we prove that playing Katamari Damacy optimally is NP-hard and that it cannot be appro...
119
Voted
AIML
2004
15 years 4 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
102
Voted
4OR
2008
15 years 2 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
66
Voted
BC
2008
15 years 2 months ago
2008
DAM
2008
15 years 2 months ago
2008
Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where th...