A description of an algorithm that takes
polynomial time (that is, for a problem set of size N, the
resources required to solve the problem can be expressed as
some polynomial involving N).
Problems that are "feasible" are said to be "in P" where P is
polynomial time. Problems that are "possible" but not
"feasible" are said to be "in NP".
Last updated: 2001-04-12
A description of a project or system for
which a feasibility study gives a positive answer.
Last updated: 2006-07-11
fear-driven development ♦ feasibility study ♦ feasible ♦ feature ♦ feature creature
Try this search on