000			02369cam a22002774a 4500
008			090612s2004 gw a b 001 0 eng
010			_a2003062536
020			_a9783540140153
035			_a(Sirsi) u1789
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a004 _2 22
100	1		_aHromkovi?, Juraj, _d 1958- _92638
245	1	0	_aTheoretical computer science : _b introduction to Automata, compurability, complexity, algorithmics, randomization, communication, and cryptography / _c Juraj Hromkovi?.
260			_aBerlin ; _a New York : _b Springer, _c 2004.
300			_ax, 313 p. : _b ill. ; _c 24 cm.
490	1		_aTexts in theoretical computer science, an EATCS series
504			_aIncludes bibliographical references (p. [305]-308) and index.
505	0		_aIntroduction -- Alphabets, Words, Languages and Algorithmic Problems; Finite Automata -- Turing Machines; Computability -- Complexity Theory -- Algorithmics for Hard Problems -- Randomization Communication and Cryptography -- References.
520			_aThe 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.
650		0	_aComputer science. _92639
596			_a1
999			_c862 _d862