Sujet : Re: How to prove q is not NPC?
De : anw (at) *nospam* cuboid.co.uk (Andy Walker)
Groupes : comp.theoryDate : 30. Jul 2024, 15:52:52
Autres entêtes
Organisation : Not very much
Message-ID : <v8ar7k$utn9$1@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 30/07/2024 14:30, wij wrote:
On Tue, 2024-07-30 at 20:29 +0800, wij wrote: [...]
On Mon, 2024-07-29 at 07:00 +0800, wij wrote: [...]
Or, How do you prove the problem "determine whether n is 5" is not> a NP-hard problem?
If these cannot be proven, what the computation theory is really doing?
Did you not understand the answers you have previously had from
Ben and me, and possibly others I've forgotten [sorry if so]? Categories
such as NPC, NP-hard, ... are "interesting" only if P /= NP. If you can
prove /that/, then don't waste time here, fame and fortune await.
-- Andy Walker, Nottingham. Andy's music pages: www.cuboid.me.uk/andy/Music Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Kinross
How to prove q is not NPC?
Re: How to prove q is not NPC?
