20 search results - page 2 / 4 » coco 2006 |
COCO
2006
Springer
13 years 8 months ago
2006
Springer
COCO
2006
Springer
13 years 8 months ago
2006
Springer
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...