There is only one known relation, and it is that each NP problem can
be solved by exponential time algorithm.
"Is there problem that is not in NP but have exponential solution" =
Open problem.


On 4. Nov, 06:39 h., crypter00 <[EMAIL PROTECTED]> wrote:
> Is there any relation between algorithms that takes exponential time
> and NP problems.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to