Combinatorics with Emphasis on the Theory of Graphs, J. E. Graver; M. E. Watkins
Автор: 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.
Автор: 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.
Автор: S. B. Rao Название: Combinatorics and Graph Theory ISBN: 3540111514 ISBN-13(EAN): 9783540111511 Издательство: Springer Рейтинг: Цена: 6981.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS.
Автор: 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.
Автор: Alla Detinko; Dane Flannery; Eamonn O`Brien Название: Probabilistic Group Theory, Combinatorics, and Computing ISBN: 1447148134 ISBN-13(EAN): 9781447148135 Издательство: Springer Рейтинг: Цена: 4884.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Probabilistic Group Theory, Combinatorics and Computing is based on lecture courses held at the Fifth de Brun Workshop in Galway, Ireland in April 2011.
Описание: 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.
Автор: 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.
Описание: 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.
Автор: Harout Aydinian; Ferdinando Cicalese; Christian De Название: Information Theory, Combinatorics, and Search Theory ISBN: 3642368980 ISBN-13(EAN): 9783642368981 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 Ahlswede's Funny Character.- 49 Two Anecdotes of Rudolf Ahlswede.- Bibliography of Rudolf Ahlswede's Publications.
Описание: Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
