Are there any “complete” languages in $coNP -NP$?
-
05-11-2019 - |
Pergunta
Suppose $coNP \neq NP$
language B would be called "complete" in $coNP-NP$ if:
- $B\in coNP - NP$
- $A\in coNP-NP \implies A\leq_pB$
Are there any "complete" languages in $coNP - NP$?
Nenhuma solução correta
Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange