- 5 Risultati
prezzo più basso: € 94,40, prezzo più alto: € 117,43, prezzo medio: € 104,89
1
Theoretical Computer Science Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography - Juraj Hromkovi¿
Ordina
da buchfreund.de
€ 117,43
Spedizione: € 0,001
OrdinaLink sponsorizzato
Juraj Hromkovi¿:

Theoretical Computer Science Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography - copertina rigida, flessible

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… Altro …

Costi di spedizione:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES Buch- und Medienhandel, 14621 Schönwalde-Glien
2
Theoretical Computer Science / Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography / Juraj Hromkovi¿ / Buch / HC runder Rücken kaschiert - Hromkovi¿, Juraj
Ordina
da booklooker.de
€ 98,64
Spedizione: € 0,001
OrdinaLink sponsorizzato

Hromkovi¿, Juraj:

Theoretical Computer Science / Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography / Juraj Hromkovi¿ / Buch / HC runder Rücken kaschiert - copertina rigida, flessible

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… Altro …

Costi di spedizione:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Buchbär
3
Theoretical Computer Science | Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography | Juraj Hromkovi¿ | Buch | HC runder Rücken kaschiert - Hromkovi¿, Juraj
Ordina
da booklooker.de
€ 94,40
Spedizione: € 0,001
OrdinaLink sponsorizzato
Hromkovi¿, Juraj:
Theoretical Computer Science | Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography | Juraj Hromkovi¿ | Buch | HC runder Rücken kaschiert - copertina rigida, flessible

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… Altro …

Costi di spedizione:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) preigu
4
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (Texts in Theoretical Computer Science. An EATCS Series) - Hromkovi?, Juraj
Ordina
da Amazon.de (Intern. Bücher)
€ 106,99
Spedizione: € 0,001
OrdinaLink sponsorizzato
Hromkovi?, Juraj:
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (Texts in Theoretical Computer Science. An EATCS Series) - copertina rigida, flessible

2003, ISBN: 9783540140153

Springer, Gebundene Ausgabe, Auflage: 2011, 323 Seiten, Publiziert: 2003-09-18T00:00:01Z, Produktgruppe: Buch, 1.42 kg, Verkaufsrang: 1453482, Informatik, IT-Ausbildung & -Berufe, Compute… Altro …

Costi di spedizione:Auf Lager, Lieferung von Amazon. (EUR 0.00) Amazon.de
5
Theoretical Computer Science - Juraj Hromkovic
Ordina
da Weltbild.de
€ 106,99
Spedizione: € 14,951
OrdinaLink sponsorizzato
Juraj Hromkovic:
Theoretical Computer Science - nuovo libro

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… Altro …

Nr. 2026078. Costi di spedizione:, 2-5 Werktage, zzgl. Versandkosten. (EUR 14.95)

1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli 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.

Informazioni dettagliate 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
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2003
Editore: Springer
313 Pagine
Peso: 0,660 kg
Lingua: ger/Deutsch

Libro nella banca dati dal 2007-05-15T22:25:27+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2023-12-12T22:27:51+01:00 (Zurich)
ISBN/EAN: 3540140158

ISBN - Stili di scrittura alternativi:
3-540-14015-8, 978-3-540-14015-3
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : juraj hromkovic, jura
Titolo del libro: texts, theoretical computer science, introduction cryptography, communication complexity, automata


Dati dell'editore

Autore: Juraj Hromkovič
Titolo: Texts in Theoretical Computer Science. An EATCS Series; Theoretical Computer Science - Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
Editore: Springer; Springer Berlin
313 Pagine
Anno di pubblicazione: 2003-09-18
Berlin; Heidelberg; DE
Lingua: Inglese
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

< Per archiviare...