Is unsorted DB searching in NP?
From: d. lee (donghunlee8_at_hotmail.com)
Date: 07/20/04
- Next message: Daryl McCullough: "Re: Disproof of the Halting Problem's Conclusion"
- Previous message: Peter Olcott: "Re: Disproof of the Halting Problem's Conclusion"
- Next in thread: Mitch Harris: "Re: Is unsorted DB searching in NP?"
- Reply: Mitch Harris: "Re: Is unsorted DB searching in NP?"
- Reply: David Wagner: "Re: Is unsorted DB searching in NP?"
- Reply: Lash Rambo: "Re: Is unsorted DB searching in NP?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 20 Jul 2004 05:48:43 -0700
Problem:
An array A[i] ,i=1..N, (N=2^n)
contains N-1 '0' and only one '1' in unsorted manner.
Find i where A[i]=1.
Question:
1. Is this problem in NP?
2. Is this EXP (which is not P) ?
3. according to 1 &2
can we say NP!=P?
Thank you many times.
- Next message: Daryl McCullough: "Re: Disproof of the Halting Problem's Conclusion"
- Previous message: Peter Olcott: "Re: Disproof of the Halting Problem's Conclusion"
- Next in thread: Mitch Harris: "Re: Is unsorted DB searching in NP?"
- Reply: Mitch Harris: "Re: Is unsorted DB searching in NP?"
- Reply: David Wagner: "Re: Is unsorted DB searching in NP?"
- Reply: Lash Rambo: "Re: Is unsorted DB searching in NP?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|