Tag reductions - Dies ist Seite 7 - GeneraCodice

Reduzierungen von und von Prime

https://www.generacodice.com/de/articolo/2456398/reduzierungen-von-und-von-prime
  reductions
cs.stackexchange cs.stackexchange

Äquivalenz zwischen min uncout und min-csp_xor

https://www.generacodice.com/de/articolo/2456016/aequivalenz-zwischen-min-uncout-und-min-csp-xor
  constraint-satisfaction  -  reductions  -  bipartite-graph
cs.stackexchange cs.stackexchange

Hardness of a scheduling/assignment problem

https://www.generacodice.com/de/articolo/2452798/hardness-of-a-scheduling-assignment-problem
  scheduling  -  np-hard  -  algorithms  -  reductions  -  bipartite-matching
cs.stackexchange cs.stackexchange

IS there a consensus on the definition of a computer program in CS literature and if so, what is it?

https://www.generacodice.com/de/articolo/2452522/is-there-a-consensus-on-the-definition-of-a-computer-program-in-cs-literature-and-if-so-what-is-it
  terminology  -  reductions
cs.stackexchange cs.stackexchange

Two versions of Subset Sum Problem

https://www.generacodice.com/de/articolo/2452373/two-versions-of-subset-sum-problem
  complexity-theory  -  np-complete  -  subset-sum  -  reductions
cs.stackexchange cs.stackexchange

Reduzieren Sie $ l_c={\ \ Langle m_1 \ Rangle, \ Langle M_2 \ Rangle): l (m_1) \ cap l (m_2) \ neq \ emesyset \} $ to $ a_ {tm} $

https://www.generacodice.com/de/articolo/2450771/reduzieren-sie-l-c-langle-m-1-rangle-langle-m-2-rangle-l-m-1-cap-l-m-2-neq-emesyset-to-a-tm
  complexity-theory  -  turing-machines  -  computability  -  reductions
cs.stackexchange cs.stackexchange

Warum ist $ a ≤_p \ # Sat $, wenn $ a \ in BPP $

https://www.generacodice.com/de/articolo/2450565/warum-ist-a-p-sat-wenn-a-in-bpp
  complexity-theory  -  turing-machines  -  computability  -  reductions  -  probabilistic-turing-machines
cs.stackexchange cs.stackexchange

Ist die Anzahl der NP-kompletten Probleme endlich?

https://www.generacodice.com/de/articolo/2449966/ist-die-anzahl-der-np-kompletten-probleme-endlich
  complexity-theory  -  np-complete  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Wenn es keine Reduzierung von A bis B gibt

https://www.generacodice.com/de/articolo/2448353/wenn-es-keine-reduzierung-von-a-bis-b-gibt
  computability  -  reductions
cs.stackexchange cs.stackexchange

Is the Clique Problem polynomial time reducible to the graph-Homomorphism Problem and if so what does the reduction look like?

https://www.generacodice.com/de/articolo/2447894/is-the-clique-problem-polynomial-time-reducible-to-the-graph-homomorphism-problem-and-if-so-what-does-the-reduction-look-like
  complexity-theory  -  np-complete  -  graphs  -  reductions
cs.stackexchange cs.stackexchange
Gefundene Ergebnisse: 998
scroll top