CORR
2004
Springer
14 years 8 days ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
ECCC
2006
14 years 13 days ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
ASIACRYPT
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
COCO
2006
Springer
14 years 4 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...
IROS
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract— We have experimented with different neural network based architectures for bio-inspired self-organizing texture and hardness perception systems. To this end we have dev...
HAPTICS
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract. Compressibility or hardness of objects is an important aspect in haptic perception. Both cutaneous and kinaesthetic information are used for the perception of compressibi...