- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Pseudo-polynomial time algorithms

- Complex systems theory
- >
- Computational complexity theory
- >
- Strongly NP-complete problems
- >
- Pseudo-polynomial time algorithms

- Computational complexity theory
- >
- NP-complete problems
- >
- Strongly NP-complete problems
- >
- Pseudo-polynomial time algorithms

- Computational complexity theory
- >
- NP-complete problems
- >
- Weakly NP-complete problems
- >
- Pseudo-polynomial time algorithms

- Computational problems
- >
- NP-complete problems
- >
- Strongly NP-complete problems
- >
- Pseudo-polynomial time algorithms

- Computational problems
- >
- NP-complete problems
- >
- Weakly NP-complete problems
- >
- Pseudo-polynomial time algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Pseudo-polynomial time algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Pseudo-polynomial time algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Pseudo-polynomial time algorithms

- Theory of computation
- >
- Computational complexity theory
- >
- Strongly NP-complete problems
- >
- Pseudo-polynomial time algorithms

Pseudo-polynomial time

In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the numeric value of the input (the largest integer present in the input)—

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

Pseudopolynomial time number partitioning

In computer science, pseudopolynomial time number partitioning is a pseudopolynomial time algorithm for solving the partition problem. The problem can be solved using dynamic programming when the size

Quadratic knapsack problem

The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective function: Given a set of items, each with a

© 2023 Useful Links.