This paper discusses the validity of using common random numbers (CRNs) with two-stage selection procedures to improve the possibility of correct selection and discusses the intri...
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
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...