What does increasing the dimensions produce? Every box or object will always have 3 dimensions: length, width and height in addition to its weight. So ...
What does increasing the dimensions produce? Every box or object will always have 3 dimensions: length, width and height in addition to its weight. So ...
I know if we want to prove the np completeness of some problem we must show these : there is a nondeterministic polynomial solution for the proble ...
Problem I want to pick a subset of fixed size from a list of items such that the count of the most frequent occurrence of the labels of the selected ...
It is a many-to-one assignment problem with N tasks and M people. Each person can get multiple tasks, while each task can be assigned to only one per ...
Suppose there is a satisfiability problem (call it oscillating-CNF) where the input is a list of CNF clauses and we want to show that this problem is ...
Do we measure the NP-hardness in terms of average-case hardness or worst-case hardness? I've found this here: "However, NP-completeness is defined i ...
I'd like to detect a "complete loop". Let's suppose that lists are connectable if the first value of a list is equal to the end value of another list. ...
. Answers to this question are eligible for a +100 reputation bounty. Bounty g ...
I have a situation in which I need to find optimal split positions in an array based on some costs. The problem goes like this: As input I have an ar ...
Choose the correct statement(s): (A) If X is an NP-complete problem, then X is an NP problem (B) If X is an NP-complete problem, then X is an NP ...
I want to find all partitions of a n elements into k subsets, this is my algorithm based on recursive formula for finding all Stirling second numbers ...
Given 2 arrays of integers a[] and b[] with the same size of n (1 <= n <= 100) numbered from 1 to n. (0 <= a[i], b[i] <= 6) You can swap ...
The question is as such: A 2d grid with obstacles has been given with 'n' robots. The robots can move in the adjacent cell within one time-tick. There ...
I have an optimization problem with a minimization cost function and two constraints to meet. Without considering one of the constraints, I can reduce ...
The proof is needed: Finding all possible simple path in an undirected graph is NP hard/ NP complete. The graph may contain multiple edges between sa ...
Hamiltonian Path is a path that connects all nodes without repeat and it is an NP-complete problem. Is the Shortest Hamiltonian Path (SHP) NP-hard ...
Suppose i have a random sequence(ordering array) which contain n positive float . How to find subsequence of size k such that the minimum distance bet ...
I am trying to customize Optaplanner for my particular use-case. I have been successful so far but now I am struck at the point where I need to have m ...
I want to know about NP-Hard from a requirements engineering point of view and not mathematical. Any input is appreciated. ...
What I know (NOT strictly speaking) I know that there is an open question about the equality of P and NP Classes and as long as there is no known alg ...