633 search results - page 8 / 127 » Locality and Hard SAT-Instances |
118
Voted
SAT
2009
Springer
15 years 8 months ago
2009
Springer
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
125
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
110
click to vote
ECCC
2006
15 years 1 months 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...
117
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
127
Voted
TASE
2010
IEEE
14 years 8 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...