1132 search results - page 22 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
TCS
2002
13 years 7 months ago
2002
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...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
SIROCCO
2008
13 years 8 months ago
2008
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...