Feasible Mathematics A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

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:
Bibliographic Details
Main Authors: Buss, S.R (Author), Scott, P.J (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser, 1990.
Edition:1st ed. 1990.
Series:Progress in Computer Science and Applied Logic, 9
Springer eBook Collection.
Subjects:
Computer science.
Mathematics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Copy 1 Available

Similar Items