skip to main | skip to sidebar

Thanh-Nhan Nguyen Blog

Thursday, May 26, 2011

Using 3SAT to prove Knapsack, Clique's hardness

http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk-fivese4.html#Q1-60004-22
Posted by Thanh-Nhan Nguyen at 8:56 AM No comments:
Labels: approximation algorithms
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

Blog Archive

  • ▼  2011 (1)
    • ▼  May (1)
      • Using 3SAT to prove Knapsack, Clique's hardness
  • ►  2010 (1)
    • ►  January (1)
  • ►  2009 (4)
    • ►  September (2)
    • ►  March (1)
    • ►  February (1)
  • ►  2008 (30)
    • ►  December (4)
    • ►  November (1)
    • ►  October (2)
    • ►  August (3)
    • ►  July (1)
    • ►  June (3)
    • ►  May (6)
    • ►  April (4)
    • ►  March (4)
    • ►  February (2)
  • ►  2007 (34)
    • ►  November (8)
    • ►  October (12)
    • ►  September (10)
    • ►  August (4)