【算法笔记】2-SAT

好久没有见到这种清新脱俗的算法了!
刘汝佳的白书上面有这个东西,所以基础部分就自行翻阅啦!

唯一想说的是,有一种O(M)判定是否存在解的算法:
直接求一个SCC,然后看那两个点是否在同一个SCC里即可
当然这种算法也可以求出一组可行解,
但貌似刘汝佳的算法时间勉强够用了,所以就不管了吧( •̀ ω •́ )y

16 thoughts to “【算法笔记】2-SAT”

  1. Thanks on your marvelous posting! I truly enjoyed reading it, you
    happen to be a great author.I will be sure to bookmark your blog and will often come back someday.

    I want to encourage you continue your great writing, have a nice day!

  2. 499087 449390I like what you guys are up too. Such smart work and reporting! Carry on the superb works guys Ive incorporated you guys to my blogroll. I believe it will improve the value of my web site 876794

  3. 801409 480275Extremely man or woman speeches want to seat giving observe into couples. Brand new sound system just before unnecessary people really should always be mindful of generally senior common rule from public speaking, which is to be the mini. best man speaches 7222

  4. 580313 136251I must admit that this really is 1 wonderful insight. It surely gives a company the opportunity to get in on the ground floor and really take part in creating something particular and tailored to their needs. 573512

  5. 690313 754137Hey, you used to write amazing, but the last couple of posts have been kinda boringK I miss your wonderful writings. Past few posts are just a bit out of track! come on! 491296

Leave a Reply

Your email address will not be published. Required fields are marked *