علامة parameterized-complexity - هذه الصفحة 1 - GeneraCodice

هل هناك NP-hard المشكلة التي لا ثابت-المعلمة لين العريكة خوارزمية موجود ؟

https://www.generacodice.com/ar/articolo/2477460/هل-هناك-np-hard-المشكلة-التي-لا-ثابت-المعلمة-لين-العريكة-خوارزمية-موجود
  complexity-theory  -  np-hard  -  parameterized-complexity
cs.stackexchange cs.stackexchange

هل هناك أي معروف W[3] أو W[3]-من الصعب مشاكل ؟

https://www.generacodice.com/ar/articolo/2474852/هل-هناك-أي-معروف-w-3-أو-w-3-من-الصعب-مشاكل
  complexity-theory  -  complexity-classes  -  parameterized-complexity
cs.stackexchange cs.stackexchange

تقدير P في قانون أمدال نظريا وعمليا

https://www.generacodice.com/ar/articolo/2462289/تقدير-p-في-قانون-أمدال-نظريا-وعمليا
  concurrency  -  parallel-computing  -  parameterized-complexity  -  multi-tasking
cs.stackexchange cs.stackexchange

Determine smallest possible parameter set for FPT

https://www.generacodice.com/ar/articolo/1613180/determine-smallest-possible-parameter-set-for-fpt
  complexity-theory  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Parametrized reduction from 3-SAT to Independent Set to lower bound running time under ETH assumption

https://www.generacodice.com/ar/articolo/1612670/parametrized-reduction-from-3-sat-to-independent-set-to-lower-bound-running-time-under-eth-assumption
  complexity-theory  -  3-sat  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Is model checking PSpace-hard *in formula size*?

https://www.generacodice.com/ar/articolo/1610978/is-model-checking-pspace-hard-in-formula-size
  complexity-theory  -  model-checking  -  linear-temporal-logic  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Why is dominating set in $W[2]$, but independent set in $W[1]$

https://www.generacodice.com/ar/articolo/1604337/why-is-dominating-set-in-w-2-but-independent-set-in-w-1
  complexity-theory  -  graphs  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Relationship between complexity classes XP and W[1]?

https://www.generacodice.com/ar/articolo/1603743/relationship-between-complexity-classes-xp-and-w-1
  complexity-theory  -  complexity-classes  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Exhaustive search algorithm solving vertex cover of size $k$ in time $2^{k}n^{O(1)}$?

https://www.generacodice.com/ar/articolo/1600152/exhaustive-search-algorithm-solving-vertex-cover-of-size-k-in-time-2-k-n-o-1
  np-complete  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Why does $W[1] = A[1]$ hold?

https://www.generacodice.com/ar/articolo/1598486/why-does-w-1-a-1-hold
  complexity-theory  -  parameterized-complexity
cs.stackexchange cs.stackexchange
العثور على نتائج: 51
scroll top