dc.contributor.author |
HOROWITZ, ELLIS |
|
dc.contributor.author |
SAHNI, SARTAJ |
|
dc.date.accessioned |
2019-04-28T04:28:08Z |
|
dc.date.available |
2019-04-28T04:28:08Z |
|
dc.date.issued |
1978 |
|
dc.identifier.citation |
Printed in the United States of America |
en_US |
dc.identifier.isbn |
0-914894-22-6 |
|
dc.identifier.uri |
http://hdl.handle.net/123456789/1208 |
|
dc.description |
One of the most energetic areas of computer science research today is
called computational complexity. That name denotes the study of what
makes functions intrinsically difficult to compute |
en_US |
dc.description.abstract |
If we try to identify those contributions of computer science which will be
long lasting, surely one of these will be the refinement of the concept called
algorithm. Ever since man invented the idea of a machine which could perform
basic mathematical operations, the study of what can be computed
and how it can be done well was launched |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Computer Science Press |
en_US |
dc.subject |
Electronic digital computers- - Programming |
en_US |
dc.subject |
Computers and Social Controversy |
en_US |
dc.subject |
Programming Languages: A Grand Tour |
en_US |
dc.subject |
Fundamentals of Computer Algorithms |
en_US |
dc.title |
FUNDAMENTALS OF COMPUTER ALGORITHMS |
en_US |
dc.title.alternative |
COMPUTER SOFTWARE ENGINEERING SERIES |
en_US |
dc.type |
Book |
en_US |