COCO
2006
Springer
14 years 3 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
COCO
2006
Springer
14 years 3 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
COCO
2006
Springer
14 years 3 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
14 years 3 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
COCO
2006
Springer
14 years 3 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...
COCO
2006
Springer
14 years 3 months ago
2006
Springer
ANTS
2010
Springer
14 years 3 months ago
2010
Springer
ESA
2004
Springer
14 years 3 months ago
2004
Springer
ESA
2004
Springer
14 years 3 months ago
2004
Springer
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...