Pages that link to "Pseudo-polynomial time"
From HandWiki
The following pages link to Pseudo-polynomial time:
Displayed 25 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Knapsack problem (← links)
- Smoothed analysis (← links)
- Pseudo-polynomial transformation (← links)
- Strong NP-completeness (← links)
- Weak NP-completeness (← links)
- Shor's algorithm (← links)
- Change-making problem (← links)
- Sieve of Eratosthenes (← links)
- List of knapsack problems (← links)
- Quadratic knapsack problem (← links)
- K shortest path routing (← links)
- Strip packing problem (← links)
- Bin packing problem (← links)
- Alexandrov's uniqueness theorem (← links)
- PLS (complexity) (← links)
- Partition problem (← links)
- Subset sum problem (← links)
- Pseudopolynomial time number partitioning (← links)
- Fully polynomial-time approximation scheme (← links)
- Parallel task scheduling (← links)
- Welfare maximization (← links)
- Strongly-polynomial time (← links)
- Category:Pseudo-polynomial time algorithms (← links)
- Social:Efficient approximately-fair item allocation (← links)
- Software:Nucleolus (game theory) (← links)
