Drexel dragonThe Math ForumDonate to the Math Forum


Math Forum
 Ask Dr. Math
 Discussions
 Internet Newsletter
 MathTools
 Problems of the Week
 Teacher2Teacher
 Teacher Exchange
 Workshops

Search All of the Math Forum:
Browse our Internet Mathematics Library

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: NP hard
Replies: 19   Last Post: Jul 20, 2011 7:31 AM

Advanced Search
Reply to this Topic Reply to this Topic

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Arjun Gotam

Posts: 10
Registered: 7/18/11
Re: NP hard
Posted: Jul 19, 2011 10:04 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Omg. Didn't realize the meaning of a many-one reduction. Unbelievable. So that means my problem is definitely at least as hard as TSP (or EMHPP :P). So there's even a chance that this problem lies in a class higher than NP and that's probably why I could only reduce known NP-complete problems to a sub-problem of my original problem. Thanks again!

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2013. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.