Entropy, Search, Complexity - 8 Angebote vergleichen
Preise | 2013 | 2014 | 2018 | 2020 |
---|---|---|---|---|
Schnitt | € 115,00 | € 121,66 | € 117,96 | € 136,19 |
Nachfrage |
1
Entropy, Search, Complexity (2007)
~DE NW EB
ISBN: 9783540327776 bzw. 3540327770, vermutlich in Deutsch, Springer, neu, E-Book.
Lieferung aus: Deutschland, Sofort per Download lieferbar.
The present volume is a collection of survey papers in the fields of entropy, search and complexity. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. Search theory has variegated applications, among others in bioinformatics. Some of these papers also have links to linear statistics and communicational complexity. Further works survey the fundamentals of information theory and quantum source coding. The volume is recommended to experienced researchers as well as young scientists and students both in mathematics and computer science. TOC:Preface.- M. Aigner: Two colors and More.- Chr. Deppe: Coding with Feedback and Searching with Lies.- S. Ghosh, T. Shirakura, J.N. Shrivastava: Model Identification Using Search Linear Models and Search Designs.- A.G. D'yachkov, A.J. Macula, P.A. Vilenkin: Non-adaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices.- P. Harremoes: Information Topologies with Applications.- M. Keane: Reinforced Random Walk.- D. Petz: Quantum Source Coding and Data Compression.- F. Topsoe: Information Theory at the Service of Science.- P. Vitanyi: Analysis of Sorting Algorithms by Kolmogorov Complexity.- G. Wiener: Recognition Problems in Combinatorial Search. PDF, 05.04.2007.
The present volume is a collection of survey papers in the fields of entropy, search and complexity. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. Search theory has variegated applications, among others in bioinformatics. Some of these papers also have links to linear statistics and communicational complexity. Further works survey the fundamentals of information theory and quantum source coding. The volume is recommended to experienced researchers as well as young scientists and students both in mathematics and computer science. TOC:Preface.- M. Aigner: Two colors and More.- Chr. Deppe: Coding with Feedback and Searching with Lies.- S. Ghosh, T. Shirakura, J.N. Shrivastava: Model Identification Using Search Linear Models and Search Designs.- A.G. D'yachkov, A.J. Macula, P.A. Vilenkin: Non-adaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices.- P. Harremoes: Information Topologies with Applications.- M. Keane: Reinforced Random Walk.- D. Petz: Quantum Source Coding and Data Compression.- F. Topsoe: Information Theory at the Service of Science.- P. Vitanyi: Analysis of Sorting Algorithms by Kolmogorov Complexity.- G. Wiener: Recognition Problems in Combinatorial Search. PDF, 05.04.2007.
2
Entropy, Search, Complexity (2007)
~DE NW EB
ISBN: 9783540327776 bzw. 3540327770, vermutlich in Deutsch, Springer, neu, E-Book.
Lieferung aus: Schweiz, Sofort per Download lieferbar.
The present volume is a collection of survey papers in the fields of entropy, search and complexity. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. Search theory has variegated applications, among others in bioinformatics. Some of these papers also have links to linear statistics and communicational complexity. Further works survey the fundamentals of information theory and quantum source coding. The volume is recommended to experienced researchers as well as young scientists and students both in mathematics and computer science. TOC:Preface.- M. Aigner: Two colors and More.- Chr. Deppe: Coding with Feedback and Searching with Lies.- S. Ghosh, T. Shirakura, J.N. Shrivastava: Model Identification Using Search Linear Models and Search Designs.- A.G. D'yachkov, A.J. Macula, P.A. Vilenkin: Non-adaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices.- P. Harremoes: Information Topologies with Applications.- M. Keane: Reinforced Random Walk.- D. Petz: Quantum Source Coding and Data Compression.- F. Topsoe: Information Theory at the Service of Science.- P. Vitanyi: Analysis of Sorting Algorithms by Kolmogorov Complexity.- G. Wiener: Recognition Problems in Combinatorial Search. 05.04.2007.
The present volume is a collection of survey papers in the fields of entropy, search and complexity. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. Search theory has variegated applications, among others in bioinformatics. Some of these papers also have links to linear statistics and communicational complexity. Further works survey the fundamentals of information theory and quantum source coding. The volume is recommended to experienced researchers as well as young scientists and students both in mathematics and computer science. TOC:Preface.- M. Aigner: Two colors and More.- Chr. Deppe: Coding with Feedback and Searching with Lies.- S. Ghosh, T. Shirakura, J.N. Shrivastava: Model Identification Using Search Linear Models and Search Designs.- A.G. D'yachkov, A.J. Macula, P.A. Vilenkin: Non-adaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices.- P. Harremoes: Information Topologies with Applications.- M. Keane: Reinforced Random Walk.- D. Petz: Quantum Source Coding and Data Compression.- F. Topsoe: Information Theory at the Service of Science.- P. Vitanyi: Analysis of Sorting Algorithms by Kolmogorov Complexity.- G. Wiener: Recognition Problems in Combinatorial Search. 05.04.2007.
3
Entropy, Search, Complexity (2007)
DE NW
ISBN: 9783540327776 bzw. 3540327770, in Deutsch, Springer, Berlin/Heidelberg, Deutschland, neu.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Versandkostenfrei.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
4
Carl Friedrich von Weizsäcker, Der Garten des Menschliche, Beiträge zur geschich (1978)
~DE US
ISBN: 3540327770 bzw. 9783540327776, vermutlich in Deutsch, Springer, Berlin/Heidelberg, Deutschland, gebraucht, schlechter Zustand.
Lieferung aus: Deutschland, Versandkostenfrei, Versand zum Fixpreis, 64*** Grasellenbach.
Von Händler/Antiquariat, buecherinsel_80.
Unbekannter Einband. Unser Preis. Verlag / Jahr. Carl Hansen, 1978. Akzeptabel, Festpreisangebot.
Von Händler/Antiquariat, buecherinsel_80.
Unbekannter Einband. Unser Preis. Verlag / Jahr. Carl Hansen, 1978. Akzeptabel, Festpreisangebot.
5
Entropy, Search, Complexity (2000)
DE NW EB DL
ISBN: 9783540327776 bzw. 3540327770, in Deutsch, Springer Berlin, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, Versandkostenfrei.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Entropy, Search, Complexity
DE NW EB DL
ISBN: 9783540327776 bzw. 3540327770, in Deutsch, Springer-Verlag, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, E-Book zum Download.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…