en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag parameterized-complexity - This is page 2 - GeneraCodice
Is model checking PSpace-hard *in formula size*?
https://www.generacodice.com/en/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/en/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/en/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/en/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/en/articolo/1598486/why-does-w-1-a-1-hold
complexity-theory
-
parameterized-complexity
cs.stackexchange
Minimum number of vertices whose removal makes the graph an independent set
https://www.generacodice.com/en/articolo/1596760/minimum-number-of-vertices-whose-removal-makes-the-graph-an-independent-set
clique
-
np-hard
-
algorithms
-
parameterized-complexity
cs.stackexchange
How is Vertex Cover reducable to Independent Set using parametrized reduction with parameter k?
https://www.generacodice.com/en/articolo/1593976/how-is-vertex-cover-reducable-to-independent-set-using-parametrized-reduction-with-parameter-k
complexity-theory
-
reductions
-
parameterized-complexity
cs.stackexchange
What is a “slice” of a parameterized problem $(Q, \kappa)$?
https://www.generacodice.com/en/articolo/1593443/what-is-a-slice-of-a-parameterized-problem-q-kappa
complexity-theory
-
parameterized-complexity
cs.stackexchange
Why are Oracle call instances bounded in the definition of FPT Turing reductions?
https://www.generacodice.com/en/articolo/1590725/why-are-oracle-call-instances-bounded-in-the-definition-of-fpt-turing-reductions
complexity-theory
-
computability
-
algorithms
-
graphs
-
parameterized-complexity
cs.stackexchange
What is the $4k$ kernelization algorithm for Planar Independent Set?
https://www.generacodice.com/en/articolo/1590709/what-is-the-4k-kernelization-algorithm-for-planar-independent-set
parameterized-complexity
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 51