Shriphani Palakodety
In Pursuit Of Truth and Beauty
  • About Me
  • Links
  • Quotes
  • Books
Browse: Home / 3-CNF-SAT

3-CNF-SAT

3 CNF SAT Fail.

By Shriphani on May 21, 2010

So, at 2:00 am last night I decided I had completed my 3-CNF-SAT algorithm (which runs in polynomial time!!). Well, here is the pseudocode: ROUTINE(P): -> Make a hashtable ‘h’ of size 3 * no. of clauses -> For clause p in P: for each ‘distinct’ variable x in p: h[x] += 1 -> Find [...]

Posted in Computer Science | Tagged 3-CNF-SAT, algorithms, Computer Science, cs, NP Complete | 5 Responses

Copyright © 2012 Shriphani Palakodety.

Powered by WordPress and Hybrid.