3415 search results - page 94 / 683 » Lower Bounds for Kernelizations |
103
Voted
JCO
2008
15 years 24 days ago
2008
We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
119
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
67
Voted
JCT
2008
15 years 24 days ago
2008
41
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
96
Voted
IPL
2006
15 years 23 days ago
2006
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...