4 search results - page 1 / 1 » On the Hardness and Easiness of Random 4-SAT Formulas |
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
AAAI
2004
13 years 6 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
AAAI
2008
13 years 7 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Controlled experiments, also called randomized experiments and A/B tests, have had a profound influence on multiple fields, including medicine, agriculture, manufacturing, and adv...