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

Prove that if $\mathsf{P^k}=\mathsf{NP}$ then $\mathsf{NP}=\mathsf{co\text{-}NP}$

https://www.generacodice.com/pt/articolo/1120614/prove-that-if-mathsf-p-k-mathsf-np-then-mathsf-np-mathsf-co-text-np
  complexity-theory  -  turing-machines  -  np
cs.stackexchange cs.stackexchange

A “natural” decidable problem not in $\mathsf{NP}$? [duplicate]

https://www.generacodice.com/pt/articolo/1119764/a-natural-decidable-problem-not-in-mathsf-np-duplicate
  np
cs.stackexchange cs.stackexchange

The exact relation between complexity classes and algorithm complexities [duplicate]

https://www.generacodice.com/pt/articolo/1118636/the-exact-relation-between-complexity-classes-and-algorithm-complexities-duplicate
  np  -  complexity-classes  -  polynomial-time
cs.stackexchange cs.stackexchange

Are there subexponential-time algorithms for NP-complete problems?

https://www.generacodice.com/pt/articolo/1118488/are-there-subexponential-time-algorithms-for-np-complete-problems
  complexity-theory  -  np-complete  -  np
cs.stackexchange cs.stackexchange

Is it necessary for NP problems to be decision problems?

https://www.generacodice.com/pt/articolo/1118245/is-it-necessary-for-np-problems-to-be-decision-problems
  np  -  algorithms  -  p-vs-np
cs.stackexchange cs.stackexchange

Problems that are Cook-reducible to a problem in NP $\cap$ co-NP

https://www.generacodice.com/pt/articolo/1118079/problems-that-are-cook-reducible-to-a-problem-in-np-cap-co-np
  complexity-theory  -  np  -  reductions
cs.stackexchange cs.stackexchange

Does reduction from an NP-complete problem to some problem $X$ imply that $X\in NP$?

https://www.generacodice.com/pt/articolo/1117847/does-reduction-from-an-np-complete-problem-to-some-problem-x-imply-that-x-in-np
  complexity-theory  -  terminology  -  np  -  reductions
cs.stackexchange cs.stackexchange

Using coloring optimization or coloring decision to solve coloring search

https://www.generacodice.com/pt/articolo/1110540/using-coloring-optimization-or-coloring-decision-to-solve-coloring-search
  graph-theory  -  np
cs.stackexchange cs.stackexchange

Intuition behind Relativization

https://www.generacodice.com/pt/articolo/1109584/intuition-behind-relativization
  complexity-theory  -  np-complete  -  np  -  relativization  -  complexity-classes
cs.stackexchange cs.stackexchange

Which of the following is the most precise classification of a problem X?

https://www.generacodice.com/pt/articolo/1005241/which-of-the-following-is-the-most-precise-classification-of-a-problem-x
  classification  -  polynomial-math  -  np
StackOverflow StackOverflow
Resultados encontrados: 620
scroll top