You are here: irt.org | FOLDOC | computational complexity
<algorithm> The number of steps or arithmetic operations required to solve a computational problem. One of the three kinds of complexity.
(1996-04-24)
Nearby terms: computability theory « computable « Computational Adequacy Theorem « computational complexity » Computational Fluid Dynamics » computational geometry » computational learning
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL