481 search results - page 3 / 97 » Martin's game: a lower bound for the number of sets |
CORR
2011
Springer
13 years 24 days ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
COMBINATORICS
2000
13 years 5 months ago
2000
We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...
PODS
2006
ACM
14 years 6 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
ECCC
2010
13 years 21 days ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
DAM
2007
13 years 5 months ago
2007
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...