Entropy, Search, Complexity / SpringerLink (Online service) ; Imre Csiszár ; Gyula O. H. Katona ; Gábor Tardos ; Gábor Wiener (2007)  

Público ISBD Título : Entropy, Search, Complexity Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Imre Csiszár ; Gyula O. H. Katona ; Gábor Tardos ; Gábor Wiener Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2007 Colección: Bolyai Society Mathematical Studies, ISSN 1217-4696 num. 16 Número de páginas: VI, 262 p Il.: online resource ISBN/ISSN/DL: 978-3-540-32777-6 Idioma : Inglés (eng) Palabras clave: Mathematics  Coding  theory  Algorithms  Bioinformatics  Topology  Combinatorics  Statistics  and  Information  Theory  Algorithm  Analysis  Problem  Complexity  Computational  Biology/Bioinformatics  for  Business/Economics/Mathematical  Finance/Insurance Clasificación: 51 Matemáticas Resumen: 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 Nota de contenido: Two Colors and More -- Coding with Feedback and Searching with Lies -- Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting d e-Disjunct Inclusion Matrices -- Model Identification Using Search Linear Models and Search Designs -- Information Topologies with Applications -- Reinforced Random Walk -- Quantum Source Coding and Data Compression -- Information Theory at the Service of Science -- Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) -- Recognition Problems in Combinatorial Search En línea: http://dx.doi.org/10.1007/978-3-540-32777-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34599 Entropy, Search, Complexity [documento electrónico] / SpringerLink (Online service) ; Imre Csiszár ; Gyula O. H. Katona ; Gábor Tardos ; Gábor Wiener . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2007 . - VI, 262 p : online resource. - (Bolyai Society Mathematical Studies, ISSN 1217-4696; 16) . ISBN : 978-3-540-32777-6 Idioma : Inglés (eng) Palabras clave: Mathematics  Coding  theory  Algorithms  Bioinformatics  Topology  Combinatorics  Statistics  and  Information  Theory  Algorithm  Analysis  Problem  Complexity  Computational  Biology/Bioinformatics  for  Business/Economics/Mathematical  Finance/Insurance Clasificación: 51 Matemáticas Resumen: 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 Nota de contenido: Two Colors and More -- Coding with Feedback and Searching with Lies -- Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting d e-Disjunct Inclusion Matrices -- Model Identification Using Search Linear Models and Search Designs -- Information Topologies with Applications -- Reinforced Random Walk -- Quantum Source Coding and Data Compression -- Information Theory at the Service of Science -- Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) -- Recognition Problems in Combinatorial Search En línea: http://dx.doi.org/10.1007/978-3-540-32777-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34599

Ejemplares

Signatura	Medio	Ubicación	Sub-localización	Sección	Estado
ningún ejemplar