Computer Science / CS 0161 · Atom · ~20 seconds
The Class P
Video not yet published
to the StudyWalks catalog
to the StudyWalks catalog
State
The polynomial time class, P, holds every problem with an algorithm whose runtime is a polynomial expression — O(1), O(log N), O(N), O(N log N), O(N squared) — the field's meaning of tractable.
Show
Searching, sorting, hashing, traversal, spanning trees, shortest paths all ride here.
Watch for
Polynomial is the boundary, not fast.