Jump to content

Category:Polynomial-time problems

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Klutzy (talk | contribs) at 14:34, 27 April 2006 (interwiki +ko). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This category is for combinatorial optimization problems solvable in polynomial time.

Pages in category "Polynomial-time problems"

The following 19 pages are in this category, out of 19 total. This list may not reflect recent changes.

0–9

3SUM

A

Assignment problem

B

Bellman–Ford algorithm

C

E

F

Floyd–Warshall algorithm

K

K shortest path routing

L

Longest common subsequence

M

N

Network simplex algorithm

S

W

Widest path problem

Y

Yen's algorithm

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Polynomial-time_problems&oldid=50426978"

Computational complexity theory