Feasible Mathematics A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989 / by S.R. Buss, P.J. Scott.
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is...
Full description
Saved in: