Results 1 to 2 of 2

Thread: NP Complete.

  1. Nov 16th, 2005, 06:55 PM #1
    capsulecorpjx
    capsulecorpjx is offline

    Thread Starter
    Hyperactive Member capsulecorpjx's Avatar
    Join Date
    May 2005
    Location
    Renton, WA
    Posts
    288

    NP Complete.

    Has anyone proven that NP Complete problems can not be solved quickly?

    Isn't it the holy grail of computer science to solve all NP complete problems quickly?

    http://en.wikipedia.org/wiki/NP-complete

    Once thats figured out, maybe AI will be easier to attain.
    "I like to run on treadmills, because at least I know I'm getting nowhere."
    - Me
    Reply With Quote Reply With Quote
  2. Nov 16th, 2005, 10:27 PM #2
    sql_lall
    sql_lall is offline
    Fanatic Member sql_lall's Avatar
    Join Date
    Jul 2002
    Location
    Up Above (i.e. AUS)
    Posts
    571

    Re: NP Complete.

    Yes, P=NP is one of *the* big problems.
    In fact, it's one of the Clay Institute's Millenium Problems.
    http://www.claymath.org/millennium/
    Though, if you can prove it, then you win $1000000, so probably wouldn't post the solution on a forum
    sql_lall
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules


Click Here to Expand Forum to Full Width