MARC details
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
090612s2004 gw a b 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
|---|
| LC control number |
2003062536 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783540140153 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(Sirsi) u1789 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
EG-CaNU |
| Transcribing agency |
EG-CaNU |
| Modifying agency |
EG-CaNU |
| 042 ## - AUTHENTICATION CODE |
|---|
| Authentication code |
ncode |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004 |
| Edition number |
22 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Hromkovi?, Juraj, |
| Dates associated with a name |
1958- |
| 9 (RLIN) |
2638 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Theoretical computer science : |
| Remainder of title |
introduction to Automata, compurability, complexity, algorithmics, randomization, communication, and cryptography / |
| Statement of responsibility, etc. |
Juraj Hromkovi?. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Berlin ; |
| -- |
New York : |
| Name of publisher, distributor, etc. |
Springer, |
| Date of publication, distribution, etc. |
2004. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
x, 313 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Texts in theoretical computer science, an EATCS series |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references (p. [305]-308) and index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Introduction -- Alphabets, Words, Languages and Algorithmic Problems; Finite Automata -- Turing Machines; Computability -- Complexity Theory -- Algorithmics for Hard Problems -- Randomization Communication and Cryptography -- References. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation. An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design. |
| 596 ## - |
|---|
| -- |
1 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer science. |
| 9 (RLIN) |
2639 |