- Complex systems theory
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- Weakly NP-complete problems

- Computational complexity theory
- >
- Computational problems
- >
- NP-complete problems
- >
- Weakly NP-complete problems

- Mathematical problems
- >
- Computational problems
- >
- NP-complete problems
- >
- Weakly NP-complete problems

- Theory of computation
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- Weakly NP-complete problems

Knapsack problem

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total we

Weak NP-completeness

In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard) if there is an algorithm for the problem whose running time is polynomial in the dimension of

Partition problem

In number theory and computer science, the partition problem, or number partitioning, is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and

Subset sum problem

The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset of integers and a target-sum , and the question is to decide whether any su

0-1 knapsack problem

No description available.

© 2023 Useful Links.