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 np-hard - This is page 8 - GeneraCodice
2D packing in fixed dimensions rectangle
https://www.generacodice.com/en/articolo/2463974/2d-packing-in-fixed-dimensions-rectangle
optimization
-
np-hard
-
algorithms
cs.stackexchange
How to prove finding two paths that are at least k edges apart is NP-hard?
https://www.generacodice.com/en/articolo/2463884/how-to-prove-finding-two-paths-that-are-at-least-k-edges-apart-is-np-hard
np-hard
-
3-sat
-
graphs
cs.stackexchange
Disjoint union of NP-hard problem and P problem is NP-hard
https://www.generacodice.com/en/articolo/2463859/disjoint-union-of-np-hard-problem-and-p-problem-is-np-hard
complexity-theory
-
np-hard
cs.stackexchange
Is the complexity of problems in NP exponential at most?
https://www.generacodice.com/en/articolo/2463514/is-the-complexity-of-problems-in-np-exponential-at-most
complexity-theory
-
np-complete
-
np-hard
cs.stackexchange
Is P contained in NP-hard?
https://www.generacodice.com/en/articolo/2461916/is-p-contained-in-np-hard
complexity-theory
-
np-hard
-
np
cs.stackexchange
Scheduling to minimize the truncated gaps
https://www.generacodice.com/en/articolo/2460090/scheduling-to-minimize-the-truncated-gaps
np-hard
-
algorithms
-
reductions
cs.stackexchange
Is the knapsack problem NP-hard when $v_i=i$?
https://www.generacodice.com/en/articolo/2459615/is-the-knapsack-problem-np-hard-when-v-i-i
np-hard
-
reductions
cs.stackexchange
Minimize the sum of gaps
https://www.generacodice.com/en/articolo/2459251/minimize-the-sum-of-gaps
np-complete
-
np-hard
-
algorithms
cs.stackexchange
Color coding to get an FPT algoirthm for $k$ disjoint triangles
https://www.generacodice.com/en/articolo/2453352/color-coding-to-get-an-fpt-algoirthm-for-k-disjoint-triangles
complexity-theory
-
np-hard
-
randomized-algorithms
cs.stackexchange
NP-hard or not: partition with irrational input or parameter
https://www.generacodice.com/en/articolo/2453190/np-hard-or-not-partition-with-irrational-input-or-parameter
complexity-theory
-
np-complete
-
np-hard
cs.stackexchange
«
5
6
7
8
9
10
»
Results found: 647