Re: Problems in NP with infinite number of possibiltiies to check?
- From: tchow@xxxxxxxxxxxxx
- Date: 23 Apr 2005 20:45:26 GMT
In article <d4bmoj$7cr$1@xxxxxxxxxxxxxxxxxxxx>,
Richard Hayden <rah03@xxxxxxxxxxxxxxxxxxx> wrote:
>Are problems where you are trying to find if a possibility for something
>exists out of a infinite number of possibilites in NP if checking
>whether or not they are a possibility is in P?
I'm not sure exactly what your question is, but under most construals that I
can think of, the answer is no.
For example, suppose I ask whether a given diophantine equation has a
solution. If you give me a candidate solution, then I can rapidly check
whether it's a solution. However, the original problem is undecidable.
--
Tim Chow tchow-at-alum-dot-mit-dot-edu
The range of our projectiles---even ... the artillery---however great, will
never exceed four of those miles of which as many thousand separate us from
the center of the earth. ---Galileo, Dialogues Concerning Two New Sciences
.
- References:
- Problems in NP with infinite number of possibiltiies to check?
- From: Richard Hayden
- Problems in NP with infinite number of possibiltiies to check?
- Prev by Date: Re: Problems in NP with infinite number of possibiltiies to check?
- Next by Date: Re: P=NP: Linear Programming Formulation of the TSP
- Previous by thread: Re: Problems in NP with infinite number of possibiltiies to check?
- Index(es):
Relevant Pages
|