W h e n analyzing the probabil ist ic per formance of an a lgor i thm one usually considers this a lgor i thm w.r.t , an infinite family of probabi l i ty spaces of inputs. In case of satisfiability… (More)

Abstract. We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key.… (More)

A simple first moment argument shows that in a randomly chosen k-SAT formula withm clauses over n boolean variables, the fraction of satisfiable clauses is at most 1−2−k +o(1) asm/n →∞ almost surely.… (More)

A resolution proof of an unsatisfiable propositional formula in conjunctive normal form is a “Davis-Putnam resolution proof” iff there exists a sequence of the variables of the formula such thatx is… (More)

It is known that random k-SAT instances with at least cn clauses, where c = ck is a suitable constant, are unsatisfiable (with high probability). We consider the problem to certify efficiently the… (More)