# Category:Polynomial-time problems

Here is a list of articles in the category **Polynomial-time problems** of the Computing portal that unifies foundations of mathematics and computations using computers. This category is for combinatorial optimization problems solvable in polynomial time.

## Pages in category "Polynomial-time problems"

The following 17 pages are in this category, out of 17 total.

### 3

- 3SUM
*(computing)*

### A

- Assignment problem
*(computing)*

### B

- Bellman–Ford algorithm
*(computing)*

### C

- Circuit Value Problem
*(computing)*

### E

- Edge cover
*(computing)* - Element distinctness problem
*(computing)* - Emptiness problem
*(computing)*

### F

- Floyd–Warshall algorithm
*(computing)*

### K

- K shortest path routing
*(computing)*

### L

- Longest common subsequence problem
*(computing)*

### M

- Matching (graph theory)
*(computing)* - Minimum spanning tree
*(computing)*

### N

- Network simplex algorithm
*(computing)*

### S

- Seidel's algorithm
*(computing)* - Shortest path problem
*(computing)*

### W

- Widest path problem
*(computing)*

### Y

- Yen's algorithm
*(computing)*