• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Pnp
 

Pnp

on

  • 1,523 views

 

Statistics

Views

Total Views
1,523
Views on SlideShare
820
Embed Views
703

Actions

Likes
2
Downloads
3
Comments
0

7 Embeds 703

http://peopleyun.com 686
http://static.slidesharecdn.com 6
http://www.zhuaxia.com 3
http://xianguo.com 3
http://reader.youdao.com 2
http://webcache.googleusercontent.com 2
http://127.0.0.1:8795 1
More...

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment
  • “At random” means that all possible clauses are equally likely to be chosen
  • This lovely graph is due to Bart Selman of Cornell University. Here, k=3. On the x-axis, we have the clause-to-variable ratio. The y-axis stands for the fraction of all formulas that are satisfiable, and the relative running time of the usual industrial strength SAT solver for solving the instance. It certainly looks like the truly hard instances of Sat lie here, around the phase transition point. (This point is empirically 4.26, but it has not been rigorously proven.) Phase transition: analogous to the physical transition from liquid to gas: it occurs at a certain critical “temperature”
  • Cluster: Just means that the satisfying assignments are all very tightly “close” together. Hamming distance: the distance between two assignments is the number of bits in which they differ
  • So think of the space of all satisfying assignments as points in n-dimensional space, and we connect two points with a line if they are within distance 1 of each other. Then here is a “cartoon” of what a typical solution space looks like in the RSB phase.... We have many clusters which are all “far” from each other in space. The RSB satisfiable phase has been rigorously shown to exist for k >= 9 Deolalikar’s proof focuses on formulas arising from this RSB satisfiable phase. These are the ones he considers to have a solution spaces with “complex” structure. And indeed it is this RSB satisfiable phase that is considered to contain “hard to satisfy” formulas, since empirically, the known SAT algorithms tend to get tripped up on these formulas (there is some debate among the statistical physicists about this, though!)
  • People tried many different tricks to try to get ahold of what’s going on in the proof. One thing they stumbled on was the following. Make sure your proof doesn’t prove too much! (In particular, make sure it does not prove false statements)
  • Now what does the solution space to F’ look like? Well, a little thought shows that it is nothing more than a translation of the solution space of F! Furthermore, the all-zero assignment satisfies F’, so we have turned a “hard” formula into an “easy” one, without changing the solution space!
  • We were excited because the proof strategy is new. The mere fact that no one tried it before gave it a chance of working.

Pnp Pnp Presentation Transcript