Pages that link to "Pseudo-polynomial time"
Jump to navigation
Jump to search
The following pages link to Pseudo-polynomial time:
Displaying 25 items.
- Knapsack problem (← links)
- Subset sum problem (← links)
- Shor's algorithm (← links)
- Sieve of Eratosthenes (← links)
- Bin packing problem (← links)
- Fully polynomial-time approximation scheme (← links)
- Partition problem (← links)
- PLS (complexity) (← links)
- List of knapsack problems (← links)
- Smoothed analysis (← links)
- Change-making problem (← links)
- Congestion game (← links)
- Quadratic knapsack problem (← links)
- Pseudo-polynomial transformation (← links)
- Strip packing problem (← links)
- Parallel task scheduling (← links)
- Efficient approximately fair item allocation (← links)
- Pseudopolynomial time number partitioning (← links)
- Karmarkar–Karp bin packing algorithms (← links)
- Talent scheduling (← links)
- Welfare maximization (← links)
- Nucleolus (game theory) (← links)
- Strongly-polynomial time (← links)
- Testwiki:Reference desk/Archives/Mathematics/2011 March 18 (← links)
- Testwiki:Reference desk/Archives/Mathematics/2018 March 12 (← links)