- P versus NP problem
http://en.wikipedia.org/wiki/P_%3D_NP_problem
- NP-hard
http://en.wikipedia.org/wiki/NP-hard
- NP-complete
http://en.wikipedia.org/wiki/NP-complete
- Strongly NP-complete
http://en.wikipedia.org/wiki/Strongly_NP-complete
- Weakly NP-complete
http://en.wikipedia.org/wiki/Weakly_NP-complete
- NP-easy
http://en.wikipedia.org/wiki/NP-easy
- NP-equivalent
http://en.wikipedia.org/wiki/NP-equivalent
Computer, Technology, Databases, Google, Internet, Mobile, Linux, Microsoft, Open Source, Security, Social Media, Web Development, Business, Finance
Saturday, March 20, 2010
Nondeterministic Polynomial (NP) Problems
Interesting concepts.
Subscribe to:
Post Comments (Atom)
Popular Posts
-
Google url shortener service, goo.gl , is now much improved with newly included features like easier copy and paste, and ability to delete e...
-
I would like to apologize that sigining of my guestbook is not possible at the moment due to an unexpected bug. There is already 74 entries ...
-
Get accurate and real-time bus arrival information for public bus operators in Singapore, including SBS Transit, SMRT Buses, Go-Ahead Singap...
-
Installed FortiClient recently but the challenge in disabling the application/service from running automatically on every start-up annoyed m...
-
*********** Try to sleep now, close your eyes Soon the birds would stop singing Twinkling stars, are shining bright They'll be watch...
No comments:
Post a Comment
Do provide your constructive comment. I appreciate that.