Being NP is decidable?
From: Wei Luo (wluoa_at_tetrad.cs.sfu.ca)
Date: 11/19/04
- Next message: Torkel Franzen: "Re: Being NP is decidable?"
- Previous message: FunnyGuy: "Re: (Possibly) New model of compution"
- Next in thread: Torkel Franzen: "Re: Being NP is decidable?"
- Reply: Torkel Franzen: "Re: Being NP is decidable?"
- Reply: tchow_at_lsa.umich.edu: "Re: Being NP is decidable?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 18 Nov 2004 21:26:23 -0800
Hi there,
Maybe it is a stupid question? But I still want to know the answer.
Is there an effective procedure to test whether a problem is in NP or not?
Thanks,
Wei
- Next message: Torkel Franzen: "Re: Being NP is decidable?"
- Previous message: FunnyGuy: "Re: (Possibly) New model of compution"
- Next in thread: Torkel Franzen: "Re: Being NP is decidable?"
- Reply: Torkel Franzen: "Re: Being NP is decidable?"
- Reply: tchow_at_lsa.umich.edu: "Re: Being NP is decidable?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
