Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

TCS
2002

favoriteEmaildiscussreport

109views Theoretical Computer Science» more TCS 2002»

Martin's game: a lower bound for the number of sets

13 years 4 months ago

Martin's game: a lower bound for the number of sets

Download www.cir.ru

We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977, p. 283) and prove that the upper bound from the above mentioned reference for the number of sets needed to construct a winning strategy, is almost tight. c 2002 Elsevier Science B.V. All rights reserved.

M. Ageev

Real-time Traffic

Arruda Et Al | Non-classical Logics | Random R | TCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Lower bounds for the game colouring number of partial ktrees and planar graphs

» An Optimal Lower Bound on the Number of Variables for Graph Identification

» Improved Lower Bounds on the Price of Stability of Undirected Network Design Games

» A lower bound on the number of triangulations of planar point sets

» Model Checking Games for Branching Time Logics

» kSets Convex Quadrilaterals and the Rectilinear Crossing Number of Kn

» Total Latency in Singleton Congestion Games

» Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

» New Maximal Numbers of Equilibria in Bimatrix Games

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	M. Ageev

Comments (0)