Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Information Theory, Combinatorics, and Search Theory, Harout Aydinian; Ferdinando Cicalese; Christian De


Варианты приобретения
Цена: 6986.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Harout Aydinian; Ferdinando Cicalese; Christian De
Название:  Information Theory, Combinatorics, and Search Theory
ISBN: 9783642368981
Издательство: Springer
Классификация: ISBN-10: 3642368980
Обложка/Формат: Paperback
Страницы: 773
Вес: 1.12 кг.
Дата издания: 16.03.2013
Серия: Theoretical Computer Science and General Issues
Язык: English
Размер: 234 x 156 x 41
Основная тема: Computer Science
Подзаголовок: In Memory of Rudolf Ahlswede
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: I. Information Theory.- 1 Two New Results for Identification for Sources.- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order.- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme.- 4 Strong Secrecy for Multiple Access Channels.- 5 Capacity Results for Arbitrarily Varying Wiretap Channels.- 6 On Oblivious Transfer Capacity.- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay.- 8 Uniformly Generating Origin Destination Tables.- 9 Identification via Quantum Channels.- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel.- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities.- 12 On the Value of Multiple Read/Write Streams for Data Compression.- 13 How to Read a Randomly Mixed Up Message.- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification.- II. Combinatorics 15 Family Complexity and VC-Dimension.- 16 The Restricted Word Shadow Problem.- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals.- 18 Generic Algorithms for Factoring Strings.- 19 On Data Recovery in Distributed Databases.- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution.- 21 Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions.- 22 Threshold Functions for Distinct Parts: Revisiting Erd]os-Lehner.- 23 On Some Structural Properties of Star and Pancake Graphs.- III. Search Theory.- 24 Threshold and Majority Group Testing.- 25 Superimposed Codes and Threshold Group Testing.- 26 New Construction of Error-Tolerant Pooling Designs.- 27 Density-Based Group Testing.- 28 Group Testing with Multiple Mutually-Obscuring Positives.- 29 An Efficient Algorithm for Combinatorial Group Testing.- 30 Randomized Post-optimization for t-Restrictions.- 31 Search for Sparse Active Inputs: A Review.- 32 Search When the Lie Depends on the Target.- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs.- 34 Remarks on History and Presence of Game Tree Search and Research.- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture.- Michael Bodewig 36 Creating Order and Ballot Sequences.- Obituaries and Personal Memories.- Abschied.- 38 Rudi.- 39 Gedenkworte f]ur Rudolf Ahlswede.- 40 In Memoriam Rudolf Ahlswede 1938 - 2010.- 41 Rudolf Ahlswede 1938-2010.- 42 Remembering Rudolf Ahlswede.- 43 Rudi Ahlswede.- 44 The Happy Connection between Rudi and Japanese Researchers.- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede.- 46 Mr. Schimanski and the Pragmatic Dean.- 47 Broken Pipes.- 48 Rudolf Ahlswedes Funny Character.- 49 Two Anecdotes of Rudolf Ahlswede.- Bibliography of Rudolf Ahlswedes Publications.


Combinatorics and Graph Theory

Автор: Harris John M.
Название: Combinatorics and Graph Theory
ISBN: 1441927239 ISBN-13(EAN): 9781441927231
Издательство: Springer
Цена: 5723.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: There are certain rules that one must abide by in order to create a successful sequel. -- Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book'sfriendlystyle andlivelypresentation, interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph.

Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics

Автор: Frank G. Garvan; Mourad E.H. Ismail
Название: Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics
ISBN: 1402001010 ISBN-13(EAN): 9781402001017
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Contains research and expository papers in various topics including Number Theory, Special Functions, Physics and Combinatorics. This title also covers the developments in the fields of q-series. It is intended for researchers and graduate students interested in the developments in q-series and symbolic computation.

General Theory of Information Transfer and Combinatorics

Автор: Rudolf Ahlswede; Lars B?umer; Ning Cai; Harout Ayd
Название: General Theory of Information Transfer and Combinatorics
ISBN: 3540462449 ISBN-13(EAN): 9783540462446
Издательство: Springer
Рейтинг:
Цена: 20962.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed research papers contributed to a research project on the `General Theory of Information Transfer and Combinatorics` that was hosted from 2001-2004 at the Center for Interdisciplinary Research (ZIF) of Bielefeld University and also papers of several incorporated meetings thereof.

Discrete Geometry, Combinatorics and Graph Theory

Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia
Название: Discrete Geometry, Combinatorics and Graph Theory
ISBN: 3540706658 ISBN-13(EAN): 9783540706656
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Fourth Edition)

Автор: Bona Miklos
Название: Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Fourth Edition)
ISBN: 9813148845 ISBN-13(EAN): 9789813148840
Издательство: World Scientific Publishing
Рейтинг:
Цена: 16474.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.

Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.

New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.

The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.

The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.

The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.

The previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.

Independence Theory in Combinatorics

Автор: V. Bryant
Название: Independence Theory in Combinatorics
ISBN: 0412224305 ISBN-13(EAN): 9780412224300
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Combinatorics may very loosely be described as that branch of mathematics which is concerned with the problems of arranging objects in accordance with various imposed constraints.

Combinatorics and Graph Theory

Автор: S. B. Rao
Название: Combinatorics and Graph Theory
ISBN: 3540111514 ISBN-13(EAN): 9783540111511
Издательство: Springer
Рейтинг:
Цена: 6981.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Matrices in Combinatorics and Graph Theory

Автор: Bolian Liu; Hong-Jian Lai
Название: Matrices in Combinatorics and Graph Theory
ISBN: 1441948341 ISBN-13(EAN): 9781441948342
Издательство: Springer
Рейтинг:
Цена: 23058.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.

Graph Theory, Combinatorics and Algorithms

Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman
Название: Graph Theory, Combinatorics and Algorithms
ISBN: 1441937234 ISBN-13(EAN): 9781441937230
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.

Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics

Автор: Frank G. Garvan; Mourad E.H. Ismail
Название: Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics
ISBN: 1461379644 ISBN-13(EAN): 9781461379645
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: These are the proceedings of the conference "Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics" held at the Department of Mathematics, University of Florida, Gainesville, from November 11 to 13, 1999.

Combinatorics with Emphasis on the Theory of Graphs

Автор: J. E. Graver; M. E. Watkins
Название: Combinatorics with Emphasis on the Theory of Graphs
ISBN: 1461299160 ISBN-13(EAN): 9781461299165
Издательство: Springer
Рейтинг:
Цена: 11173.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Topics in Combinatorics and Graph Theory

Автор: Rainer Bodendiek; Rudolf Henn
Название: Topics in Combinatorics and Graph Theory
ISBN: 3642469108 ISBN-13(EAN): 9783642469107
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия