Cantitate/Preț
Produs

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography: Texts in Theoretical Computer Science. An EATCS Series

Autor Juraj Hromkovič
en Limba Engleză Paperback – 6 dec 2010
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 62194 lei  43-57 zile
  Springer Berlin, Heidelberg – 6 dec 2010 62194 lei  43-57 zile
Hardback (1) 62703 lei  43-57 zile
  Springer Berlin, Heidelberg – 18 sep 2003 62703 lei  43-57 zile

Din seria Texts in Theoretical Computer Science. An EATCS Series

Preț: 62194 lei

Preț vechi: 77743 lei
-20% Nou

Puncte Express: 933

Preț estimativ în valută:
11006 12905$ 9665£

Carte tipărită la comandă

Livrare economică 02-16 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642057298
ISBN-10: 3642057292
Pagini: 328
Ilustrații: X, 313 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:Softcover reprint of hardcover 1st ed. 2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Texts in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Introduction; Alphabets, Words, Languages and Algorithmic Problems; Finite Automata; Turing Machines; Computability; Complexity Theory; Algorithmics for Hard Problems; Randomization; Communication and Cryptography; References.

Notă biografică

 Also Author of our books "Communication Complexity and Parallel Computing", 57459-X and "Algorithmics for Hard Problems" 2nd ed., 44134-4; Advisory Board member of the EATCS series.

Caracteristici

Extremly well readable, transparent introduction to TCS All basic ideas and concepts (proofs) are first developed intuitively in context with already known facts and then formalized into detail Includes supplementary material: sn.pub/extras