Tag np - Это страница 57 - GeneraCodice

Has it been proven that the optimization TSP is (or is not) polynomial-time verifiable if P ≠ NP?

https://www.generacodice.com/ru/articolo/1491068/has-it-been-proven-that-the-optimization-tsp-is-or-is-not-polynomial-time-verifiable-if-p-np
  optimization  -  complexity-theory  -  traveling-salesman  -  np
cs.stackexchange cs.stackexchange

Existence of NP problems with complexity intermediate between P and NP-hard

https://www.generacodice.com/ru/articolo/1490362/existence-of-np-problems-with-complexity-intermediate-between-p-and-np-hard
  complexity-theory  -  np  -  reference-request  -  p-vs-np
cs.stackexchange cs.stackexchange

Help reducing 3-SAT to 3-COLORING

https://www.generacodice.com/ru/articolo/1490098/help-reducing-3-sat-to-3-coloring
  complexity-theory  -  np-complete  -  np  -  reductions
cs.stackexchange cs.stackexchange

Problems that are NP but polynomial on graphs of bounded treewidth

https://www.generacodice.com/ru/articolo/1490063/problems-that-are-np-but-polynomial-on-graphs-of-bounded-treewidth
  complexity-theory  -  np  -  reference-request  -  graphs  -  polynomial-time
cs.stackexchange cs.stackexchange

Complexity classes that are closed under subtraction

https://www.generacodice.com/ru/articolo/1489942/complexity-classes-that-are-closed-under-subtraction
  complexity-theory  -  np  -  closure-properties
cs.stackexchange cs.stackexchange

Prove the red blue separation problem is NP-complete

https://www.generacodice.com/ru/articolo/1489885/prove-the-red-blue-separation-problem-is-np-complete
  np-complete  -  np-hard  -  np  -  algorithms  -  algorithm-analysis
cs.stackexchange cs.stackexchange

Having trouble proving a language is NP-complete

https://www.generacodice.com/ru/articolo/1489264/having-trouble-proving-a-language-is-np-complete
  complexity-theory  -  np-complete  -  np-hard  -  np
cs.stackexchange cs.stackexchange

Direct reduction from Near-Clique to Clique

https://www.generacodice.com/ru/articolo/1466639/direct-reduction-from-near-clique-to-clique
  complexity-theory  -  np  -  graphs  -  reductions
cs.stackexchange cs.stackexchange

How do you determine if a language falls into NP?

https://www.generacodice.com/ru/articolo/1437243/how-do-you-determine-if-a-language-falls-into-np
  computer-science  -  turing-machines  -  np
StackOverflow StackOverflow

Алгоритмы аппроксимации модульного тестирования

https://www.generacodice.com/ru/articolo/1413466/алгоритмы-аппроксимации-модульного-тестирования
  algorithm  -  unit-testing  -  graph-theory  -  approximation  -  np
StackOverflow StackOverflow
Результаты найдены: 620
scroll top