Category:Polynomial-time problems

From Wikipedia, the free encyclopedia

Jump to navigation Jump to search

Template:Sister project This category is for combinatorial optimization problems solvable in polynomial time.

Script error: No such module "anchor".Pages in category "Polynomial-time problems"

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

3

3SUM

A

Assignment problem

B

Bellman–Ford algorithm

E

Edge cover

F

Floyd–Warshall algorithm

L

Longest common subsequence

M

S

Shortest path problem

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Category:Polynomial-time_problems&oldid=2440032"

Computational problems