ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A decision problem is in co-NP\mathrm{co}\textrm{-}\mathrm{NP} if its negation is in NP\mathrm{NP}. A problem is NP-complete if it lies in NP\mathrm{NP} and is NP\mathrm{NP}-hard.

NP versus co-NP conjecture.

NP≠co-NP.\mathrm{NP} \not= \mathrm{co}\textrm{-}\mathrm{NP}.

Hence, an NP\mathrm{NP}-complete problem does not lie in co-NP\mathrm{co}\textrm{-}\mathrm{NP}.

This is another widely believed open conjecture in computational complexity, closely related to the asymmetry between efficiently verifiable yes and no answers.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.