159 search results - page 12 / 32 » On the Complexity of SAT |
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
ECRTS
2006
IEEE
15 years 3 months ago
2006
IEEE
Due to the complexity and requirements of modern realtime systems, multiple teams must often work concurrently and independently to develop the various components of the system. S...
SAT
2007
Springer
15 years 3 months ago
2007
Springer
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched...
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
101
click to vote
SAT
2010
Springer
14 years 8 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...