344 search results - page 65 / 69 » Banach-Mazur Games on Graphs |
171
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
155
click to vote
MST
2006
15 years 6 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
150
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
189
click to vote
FOCS
2008
IEEE
16 years 13 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
196
click to vote
FM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...