Tag np - Esta é a página 54 - GeneraCodice

Concatenation of languages in NP

https://www.generacodice.com/pt/articolo/1528454/concatenation-of-languages-in-np
  complexity-theory  -  np  -  closure-properties
cs.stackexchange cs.stackexchange

If P = NP, then is NP = FNP?

https://www.generacodice.com/pt/articolo/1528334/if-p-np-then-is-np-fnp
  complexity-theory  -  np  -  complexity-classes
cs.stackexchange cs.stackexchange

Complexity of variation of partition problem

https://www.generacodice.com/pt/articolo/1528236/complexity-of-variation-of-partition-problem
  complexity-theory  -  np  -  partitions
cs.stackexchange cs.stackexchange

Are the complements of $NP$-languages with only $n$ words of length $n$ also in $NP$?

https://www.generacodice.com/pt/articolo/1528022/are-the-complements-of-np-languages-with-only-n-words-of-length-n-also-in-np
  complexity-theory  -  np  -  closure-properties
cs.stackexchange cs.stackexchange

Homomorphism erasing information

https://www.generacodice.com/pt/articolo/1517590/homomorphism-erasing-information
  complexity-theory  -  np  -  p-vs-np
cs.stackexchange cs.stackexchange

Why does the solution of an NP problem have to be polynomial size?

https://www.generacodice.com/pt/articolo/1517010/why-does-the-solution-of-an-np-problem-have-to-be-polynomial-size
  complexity-theory  -  np
cs.stackexchange cs.stackexchange

NP-hardness of an optimization problem with real value

https://www.generacodice.com/pt/articolo/1516839/np-hardness-of-an-optimization-problem-with-real-value
  complexity-theory  -  np-complete  -  np  -  proof-techniques  -  decision-problem
cs.stackexchange cs.stackexchange

Reduction to Maximum Independent Set

https://www.generacodice.com/pt/articolo/1515976/reduction-to-maximum-independent-set
  complexity-theory  -  np-complete  -  np  -  reductions
cs.stackexchange cs.stackexchange

if $L\in NP\cap Co-NP$ is NP-Hard, then $NP=Co-NP$

https://www.generacodice.com/pt/articolo/1512077/if-l-in-np-cap-co-np-is-np-hard-then-np-co-np
  np-hard  -  np
cs.stackexchange cs.stackexchange

NP-complete problems not “obviously” in NP

https://www.generacodice.com/pt/articolo/1512034/np-complete-problems-not-obviously-in-np
  complexity-theory  -  np-complete  -  np
cs.stackexchange cs.stackexchange
Resultados encontrados: 620
scroll top