Computer Science / CS 0118 · Atom · ~20 seconds
Algorithmic Problem-Solving
Video not yet published
to the StudyWalks catalog
to the StudyWalks catalog
State
An algorithmic problem always has a brute answer — input sizes are finite, so exhaustive search exists — which makes efficiency, in time or in space, the actual goal of the field.
Show
Generations of computer scientists have kept solved problems open by asking for faster solutions.
Watch for
"Solvable" and "solvable in time" are different claims.