Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Topics in Algorithms-Random SAT (0510-7410) -Spring 2011 Benny Applebaum
 

Summary: Topics in Algorithms- Random SAT (0510-7410) - Spring 2011
Benny Applebaum
Please collaborate in pairs and submit a printed copy of your solution by April 11th.
Problem Set #1
Question 1: Unit Clause
Let r < 8/3. Consider the invocation of Unit Clause on F3(n, rn). Let s2(t) and s3(t)
be the random variables which denote the number of 2-clauses and 3-clauses remaining
at time t. In class we proved that, conditioned on any fixed history (C2(i), C3(i))t
i=0,
we have
s3(t + 1) - s3(t) = -Bin s3(t),
3
n - t
s2(t + 1) - s2(t) = Bin s3(t),
3
2(n - t)
- Bin s2(t),
2
n - t
,

  

Source: Applebaum, Benny - Faculty of Mathematics and Computer Science, Weizmann Institute of Science

 

Collections: Computer Technologies and Information Sciences