Subjects from the theoretical computer science can often be very difficult to grasp.

Yet, their importance and the presence in everyday, technology interwoven, life cannot be overstated.



Complexity, computability, algorithms are foundations beneath everyday programming, inter-networking, security, data processing.



This is a brilliant book that only true master of the subject

can produce, but that all in both computer science and IT can appreciate.



In this book, Dr. Hromkovic with ease and in a very readable, understandable terms, explains some of the most challenging subjects from the theory of computation - algorithms, countable vs. uncountable infinity, complexity, computability, decidability, cryptography, quantum computing.



Dr. Hromkovic starts his explanations in a very simple, approachable, readable way, and he slowly and steadily leads the reader towards the level of deep qualitative understanding. His language always

reminds accessible even when he is deep into a real of theory and complex matters.



I found this book as I was looking for a gentle, readable introduction

into a complex subject. I am a PhD student in Computer Science

whose background was more on an engineering and less on a theoretical side.



I academically needed this material, but I also sought it as I developed the love for the subject.



This book was a perfect find for all my academic and intellectual needs.

Скачать книгу бесплатно (pdf, 2.61 Mb)

---

Читать «Algorithmic Adventures: From Knowledge to Magic»