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 5 - GeneraCodice
Does $\#W$[1]-hardness imply approximation hardness?
https://www.generacodice.com/en/articolo/1515830/does-w-1-hardness-imply-approximation-hardness
complexity-theory
-
counting
-
approximation
-
parameterized-complexity
cs.stackexchange
NP-hardness and FPTAS
https://www.generacodice.com/en/articolo/1466795/np-hardness-and-fptas
complexity-theory
-
approximation
-
np-hard
-
parameterized-complexity
cs.stackexchange
Courcelle's Theorem: Looking for papers
https://www.generacodice.com/en/articolo/1466631/courcelle-s-theorem-looking-for-papers
complexity-theory
-
discrete-mathematics
-
reference-request
-
graphs
-
parameterized-complexity
cs.stackexchange
Why are all problems in FPTAS also in FPT?
https://www.generacodice.com/en/articolo/1126261/why-are-all-problems-in-fptas-also-in-fpt
complexity-theory
-
approximation
-
reference-request
-
parameterized-complexity
cs.stackexchange
Find which vertices to delete from graph to get smallest largest component
https://www.generacodice.com/en/articolo/1124461/find-which-vertices-to-delete-from-graph-to-get-smallest-largest-component
graph-theory
-
complexity-theory
-
algorithms
-
parameterized-complexity
cs.stackexchange
Reduction from Vertex Cover to an Independent Set problem
https://www.generacodice.com/en/articolo/1122665/reduction-from-vertex-cover-to-an-independent-set-problem
np-complete
-
np
-
graphs
-
p-vs-np
-
parameterized-complexity
cs.stackexchange
NP complete problems that are solvable in polynomial time if the input (e.g. number of variables) is fixed?
https://www.generacodice.com/en/articolo/1122299/np-complete-problems-that-are-solvable-in-polynomial-time-if-the-input-e-g-number-of-variables-is-fixed
optimization
-
np-complete
-
linear-programming
-
decision-problem
-
parameterized-complexity
cs.stackexchange
$1+\epsilon$ approximation for inapproximable problems
https://www.generacodice.com/en/articolo/1119278/1-epsilon-approximation-for-inapproximable-problems
complexity-theory
-
np-complete
-
approximation
-
p-vs-np
-
parameterized-complexity
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 51