Deutsch   English   Français   Italiano  
<e6c84e13457b182991801bb2c50463354dff0b6b.camel@gmail.com>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!news.nobody.at!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: wij <wyniijj5@gmail.com>
Newsgroups: comp.theory
Subject: How to prove q is not NPC?
Date: Mon, 29 Jul 2024 07:00:30 +0800
Organization: A noiseless patient Spider
Lines: 5
Message-ID: <e6c84e13457b182991801bb2c50463354dff0b6b.camel@gmail.com>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Injection-Date: Mon, 29 Jul 2024 01:00:32 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="09240b90da15d5c4241363eff3f7a826";
	logging-data="155288"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19nA7vvvfben0kXUjbHnpQS"
User-Agent: Evolution 3.50.2 (3.50.2-1.fc39)
Cancel-Lock: sha1:nJtuTdDpgOYRQk1sX9b2aZq7H1Q=
Bytes: 1044

Problem q: Given a number n, determine whether n is 5 or not.
What is the VALID proof that q=E2=88=89NPC?

!!! This is a challenging question !!!