中国
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完整文章
类别
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
你写
用户
登录
登记
找回密码
标签
语言标签
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
标签parameterized-complexity - 这是页1 - GeneraCodice
是否存在NP难题,其中不存在固定参数易遗传算法?
https://www.generacodice.com/cn/articolo/2477460/是否存在np难题-其中不存在固定参数易遗传算法
complexity-theory
-
np-hard
-
parameterized-complexity
cs.stackexchange
是否有任何已知的w [3]或w [3] - 哈达问题?
https://www.generacodice.com/cn/articolo/2474852/是否有任何已知的w-3-或w-3-哈达问题
complexity-theory
-
complexity-classes
-
parameterized-complexity
cs.stackexchange
从理论和实践中估算Amdahl的法律中的P.
https://www.generacodice.com/cn/articolo/2462289/从理论和实践中估算amdahl的法律中的p
concurrency
-
parallel-computing
-
parameterized-complexity
-
multi-tasking
cs.stackexchange
Determine smallest possible parameter set for FPT
https://www.generacodice.com/cn/articolo/1613180/determine-smallest-possible-parameter-set-for-fpt
complexity-theory
-
parameterized-complexity
cs.stackexchange
Parametrized reduction from 3-SAT to Independent Set to lower bound running time under ETH assumption
https://www.generacodice.com/cn/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
Is model checking PSpace-hard *in formula size*?
https://www.generacodice.com/cn/articolo/1610978/is-model-checking-pspace-hard-in-formula-size
complexity-theory
-
model-checking
-
linear-temporal-logic
-
parameterized-complexity
cs.stackexchange
Why is dominating set in $W[2]$, but independent set in $W[1]$
https://www.generacodice.com/cn/articolo/1604337/why-is-dominating-set-in-w-2-but-independent-set-in-w-1
complexity-theory
-
graphs
-
parameterized-complexity
cs.stackexchange
Relationship between complexity classes XP and W[1]?
https://www.generacodice.com/cn/articolo/1603743/relationship-between-complexity-classes-xp-and-w-1
complexity-theory
-
complexity-classes
-
parameterized-complexity
cs.stackexchange
Exhaustive search algorithm solving vertex cover of size $k$ in time $2^{k}n^{O(1)}$?
https://www.generacodice.com/cn/articolo/1600152/exhaustive-search-algorithm-solving-vertex-cover-of-size-k-in-time-2-k-n-o-1
np-complete
-
parameterized-complexity
cs.stackexchange
Why does $W[1] = A[1]$ hold?
https://www.generacodice.com/cn/articolo/1598486/why-does-w-1-a-1-hold
complexity-theory
-
parameterized-complexity
cs.stackexchange
«
1
2
3
4
5
6
»
发现结果: 51