But then why NP means Non-deterministic Polynomial time etc..
On Nov 4, 4:59 am, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]> wrote: > 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.- Hide quoted text - > > - Show quoted text - --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
