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.
- 3SUM (computing)
- Assignment problem (computing)
- Bellman–Ford algorithm (computing)
- Circuit Value Problem (computing)
- Floyd–Warshall algorithm (computing)
- K shortest path routing (computing)
- Longest common subsequence problem (computing)
- Network simplex algorithm (computing)
- Widest path problem (computing)
- Yen's algorithm (computing)