Combinatorial Algorithms, Kreher, Donald L. , Stinson, Douglas R.
Название: Cake-cutting Algorithms : Be Fair If You Can ISBN: 1568810768 ISBN-13(EAN): 9781568810768 Издательство: Taylor&Francis Рейтинг: Цена: от 3531.00 р. Наличие на складе: Есть
Описание: A comprehensive discussion of the state-of-the-art in cake cutting problems for the novice and professional. The author offers a complete treatment of all cake cutting algorithms under all the considered definitions of "fair" and presents them in a reader-friendly manner.
Автор: Melvyn Nathanson Название: Combinatorial and Additive Number Theory II ISBN: 3319680307 ISBN-13(EAN): 9783319680309 Издательство: Springer Рейтинг: Цена: 27950.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This proceedings volume is based on a collection of papers presented at the thirteenth and fourteenth annual workshops in Combinatorial and Additive Number Theory (CANT), held at the Graduate Center of the City University of New York in 2015 and 2016.
Описание: This volume contains selected refereed papers based on lectures presented at the "Integers Conference 2011", an international conference in combinatorial number theory that was held in Carrollton, Georgia, United States in October 2011. This was the fifth Integers Conference, held bi-annually since 2003. It featured plenary lectures presented by Ken Ono, Carla Savage, Laszlo Szekely, Frank Thorne, and Julia Wolf, along with sixty other research talks. This volume consists of ten refereed articles, which are expanded and revised versions of talks presented at the conference. They represent a broad range of topics in the areas of number theory and combinatorics including multiplicative number theory, additive number theory, game theory, Ramsey theory, enumerative combinatorics, elementary number theory, the theory of partitions, and integer sequences.
Автор: Melvyn B. Nathanson Название: Combinatorial and Additive Number Theory III ISBN: 3030311058 ISBN-13(EAN): 9783030311056 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Based on talks from the 2017 and 2018 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 17 peer-reviewed and edited papers on current topics in number theory.
Автор: Melvyn B. Nathanson Название: Combinatorial and Additive Number Theory II ISBN: 3319885340 ISBN-13(EAN): 9783319885346 Издательство: Springer Рейтинг: Цена: 34937.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory.
Описание: A complete, self-contained introduction to a powerful and resurging mathematical discipline. Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd???s.
Автор: Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf Название: Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups ISBN: 3110413329 ISBN-13(EAN): 9783110413328 Издательство: Walter de Gruyter Цена: 6499.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents:Algebraic structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups
Автор: Albers Название: The G. H. Hardy Reader ISBN: 1107135559 ISBN-13(EAN): 9781107135550 Издательство: Cambridge Academ Рейтинг: Цена: 13939.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: G. H. Hardy ranks among the great mathematicians of the twentieth century, doing essential research in number theory and analysis. This book is a feast of Hardy`s writing, featuring articles ranging from the serious to the humorous. The G. H. Hardy Reader is a worthy introduction to an extraordinary individual.
Автор: P.H. Sellers Название: Combinatorial Complexes ISBN: 9027710007 ISBN-13(EAN): 9789027710000 Издательство: Springer Рейтинг: Цена: 10760.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory;
Автор: Gerard Cohen; Teo Mora; Oscar Moreno Название: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes ISBN: 3540566864 ISBN-13(EAN): 9783540566861 Издательство: Springer Рейтинг: Цена: 11179.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The aim of the symposium upon which this text is based is to attract high-level research papers and to encourage cross-fertilization among different areas which share the use of algebraic methods and techniques for applications in the sciences of computing, communications and engineering.
Автор: Melvyn B. Nathanson Название: Combinatorial and Additive Number Theory ISBN: 1493952390 ISBN-13(EAN): 9781493952397 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics.
Автор: Furstenberg Harry Название: Recurrence in Ergodic Theory and Combinatorial Number Theory ISBN: 0691615365 ISBN-13(EAN): 9780691615363 Издательство: Wiley Рейтинг: Цена: 6336.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Topological dynamics and ergodic theory usually have been treated independently. H. Furstenberg, instead, develops the common ground between them by applying the modern theory of dynamical systems to combinatories and number theory. Originally published in 1981. The Princeton Legacy Library uses the latest print-on-demand technology to again make
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
