d2jsp
Log InRegister
d2jsp Forums > Off-Topic > Computers & IT > Programming & Development > Anyone Good At Np Complete Proofs?
Add Reply New Topic New Poll
Views: 230Replies: 5Track Topic
Member
Posts: 16,993
Joined: Sep 18 2010
Gold: 28,044.60
#1
May 15 2014 08:05am
If so PM me, willing to pay potentially all my FG for a proof.
Member
Posts: 62,215
Joined: Jun 3 2007
Gold: 9,039.20
#2
May 15 2014 08:22am
only snake
Member
Posts: 9,525
Joined: Nov 5 2005
Gold: 1,338.00
#3
May 15 2014 11:13am
What class is this for?
Member
Posts: 5,269
Joined: Oct 18 2006
Gold: 21,400.00
#4
May 15 2014 12:55pm
If you want it solved in polytime it's going to cost more fg than that :P

It's been a couple of years since I took my class, but the general solution that I remember was to take your NP Complete problem and transform it into another known NP Complete problem. Then prove it is NP Hard.

If one NP Complete problem can be solved polytime, then ALL NP Complete problems can be solved polytime.

You can send it to me, but I am pretty busy and not great at it :(
Member
Posts: 16,993
Joined: Sep 18 2010
Gold: 28,044.60
#5
May 15 2014 02:50pm
Quote (xandumx @ May 15 2014 07:55pm)
If you want it solved in polytime it's going to cost more fg than that  :P

It's been a couple of years since I took my class, but the general solution that I remember was to take your NP Complete problem and transform it into another known NP Complete problem.  Then prove it is NP Hard.

If one NP Complete problem can be solved polytime, then ALL NP Complete problems can be solved polytime.

You can send it to me, but I am pretty busy and not great at it  :(


This is pretty much what I'm looking for. Paying up to 20k if someone can actually help me with this.
Member
Posts: 5,988
Joined: May 6 2006
Gold: 30.00
#6
May 16 2014 12:40pm
I just took algorithms and complexity, I may be able to help.
Go Back To Programming & Development Topic List
Add Reply New Topic New Poll

© 2003-2026 d2jsp  Contact