|
Subject: Помогите с переводом Перевожу уже долго и все-время бред какой-то выходит, если не трудно помогите пожалуйстаBelow we show that the problem P is NP-hard in the strong sense, i.e. NP-hard under an unary encoding, by a reduction from the problem NUMERICAL MATCHING WITH TARGET SUMS (NMTS) which is well know to be strongly NP-hard. Given three sets {x1,x2,...xk},{y1,y2,...yk}, and {A1,A2,...,Ak}, of k integers, is there a partition of the union of the first two sets into k subsets, such that each subset contains two integers, one from {x1,x2,...xk} and the other from {y1,y2,...yk}, and for each 1 |
|
НП-трудная проблема Есть вариант? Что непонятно? Это комбинаторика - надо изучать ... |
| не понятно вот это: by a reduction from the problem NUMERICAL MATCHING WITH TARGET SUMS (NMTS) which is well know to be strongly NP-hard |
| You need to be logged in to post in the forum |