- 5 Resultados
precio mínimo: € 37,98, precio máximo: € 117,43, precio promedio: € 91,09
1
Theoretical Computer Science Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography - Juraj Hromkovi¿
Pedir
por buchfreund.de
€ 117,43
Envío: € 0,001
PedirEnlace patrocinado
Juraj Hromkovi¿:

Theoretical Computer Science Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography - encuadernado, tapa blanda

2003, ISBN: 9783540140153

Gebunden, 332 Seiten, 241mm x 160mm x 23mm, Sprache(n): eng This textbook provides an elegant route through the theoretical fundamentals of computer science. In doing so, it shows that th… Más…

Gastos de envío:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES Buch- und Medienhandel, 14621 Schönwalde-Glien
2
Pedir
por Biblio.co.uk
$ 41,06
(aprox. € 37,98)
Envío: € 5,861
PedirEnlace patrocinado

Hromkovič, Juraj:

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

ISBN: 9783540140153

Springer. Used - Good. Ships from UK in 48 hours or less (usually same day). Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so s… Más…

Gastos de envío: EUR 5.86 Phatpocket Limited
3
Theoretical Computer Science / Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography / Juraj Hromkovi¿ / Buch / HC runder Rücken kaschiert - Hromkovi¿, Juraj
Pedir
por booklooker.de
€ 98,64
Envío: € 0,001
PedirEnlace patrocinado
Hromkovi¿, Juraj:
Theoretical Computer Science / Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography / Juraj Hromkovi¿ / Buch / HC runder Rücken kaschiert - encuadernado, tapa blanda

2003

ISBN: 9783540140153

[ED: Gebunden], [PU: Springer Berlin], Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical com… Más…

Gastos de envío:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Buchbär
4
Theoretical Computer Science | Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography | Juraj Hromkovi¿ | Buch | HC runder Rücken kaschiert - Hromkovi¿, Juraj
Pedir
por booklooker.de
€ 94,40
Envío: € 0,001
PedirEnlace patrocinado
Hromkovi¿, Juraj:
Theoretical Computer Science | Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography | Juraj Hromkovi¿ | Buch | HC runder Rücken kaschiert - encuadernado, tapa blanda

2003, ISBN: 9783540140153

[ED: Gebunden], [PU: Springer Berlin], Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical com… Más…

Gastos de envío:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) preigu
5
Theoretical Computer Science - Juraj Hromkovic
Pedir
por Weltbild.de
€ 106,99
Envío: € 14,951
PedirEnlace patrocinado
Juraj Hromkovic:
Theoretical Computer Science - libro nuevo

2003, ISBN: 3540140158

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipli… Más…

Nr. 2026078. Gastos de envío:, 2-5 Werktage, zzgl. Versandkosten. (EUR 14.95)

1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

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

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.

Detalles del libro - Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (Texts in Theoretical Computer Science. An EATCS Series)


EAN (ISBN-13): 9783540140153
ISBN (ISBN-10): 3540140158
Tapa dura
Tapa blanda
Año de publicación: 2003
Editorial: Springer
313 Páginas
Peso: 0,660 kg
Idioma: ger/Deutsch

Libro en la base de datos desde 2007-05-15T15:25:27-05:00 (Mexico City)
Página de detalles modificada por última vez el 2024-03-31T02:29:48-06:00 (Mexico City)
ISBN/EAN: 3540140158

ISBN - escritura alterna:
3-540-14015-8, 978-3-540-14015-3
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: juraj hromkovic, jura
Título del libro: texts, theoretical computer science, introduction cryptography, communication complexity, automata


Datos del la editorial

Autor: Juraj Hromkovič
Título: Texts in Theoretical Computer Science. An EATCS Series; Theoretical Computer Science - Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
Editorial: Springer; Springer Berlin
313 Páginas
Año de publicación: 2003-09-18
Berlin; Heidelberg; DE
Idioma: Inglés
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
X, 313 p.

BB; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmics; Communication; Complexity; Computability; Cryptography; Hard problems; Interconnection networks; algorithm analysis and problem complexity; Theory of Computation; Coding and Information Theory; Algorithms; Discrete Mathematics in Computer Science; Kodierungstheorie und Verschlüsselung (Kryptologie); Informationstheorie; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; BC

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.

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

 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.

This textbook provides an elegant route through the theoretical fundamentals of computer science. In doing so, it shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.

 


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

< para archivar...