Thread: t-shirt

  1. #61
    S Sang-drax's Avatar
    Join Date
    May 2002
    Göteborg, Sweden
    A proof that P = NP does not mean that all problems in NP suddenly become tractable.

    What if an algorithm is found solving 3SAT with worst-case complexity O(n^g), where g is Graham's number?
    Last edited by Sang-drax; 04-10-2010 at 06:10 AM.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. I'm trying to count the frequency of the phrase "ing"
    By thefreeman1159 in forum C Programming
    Replies: 14
    Last Post: 09-23-2008, 11:58 AM
  2. Calling functions help
    By ForlornOdium in forum C++ Programming
    Replies: 14
    Last Post: 09-29-2003, 08:40 PM
  3. Clean Jokes
    By stevey in forum A Brief History of
    Replies: 35
    Last Post: 04-27-2002, 07:13 PM