167 search results - page 4 / 34 » A New Lower Bound for A(17, 6, 6) |
COCO
2011
Springer
12 years 6 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
COMCOM
2006
13 years 7 months ago
2006
In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wirel...
FAST
2008
13 years 9 months ago
2008
The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices. Numerous erasure coding techniques have been develope...
COMPGEOM
2010
ACM
14 years 4 days ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...