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

A Journey Through Discrete Mathematics, Martin Loebl; Jaroslav Ne?et?il; Robin Thomas

Варианты приобретения
Цена: 17324р.
 о цене
Наличие: Отсутствует. Возможна поставка под заказ.

При оформлении заказа до: 30 авг 2022
Ориентировочная дата поставки: конец Сентября- начало Октября
При условии наличия книги у поставщика.

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

Автор: Martin Loebl; Jaroslav Ne?et?il; Robin Thomas
Название:  A Journey Through Discrete Mathematics
ISBN: 9783319830629
Издательство: Springer
ISBN-10: 3319830627
Обложка/Формат: Soft cover
Страницы: 810
Вес: 1.27 кг.
Дата издания: 2017
Язык: English
Издание: Softcover reprint of
Иллюстрации: 60 tables, color; 54 illustrations, color; 106 illustrations, black and white; xxxiv, 810 p. 160 illus., 54 illus. in color.
Размер: 235 x 155
Читательская аудитория: Professional & vocational
Основная тема: Mathematics
Подзаголовок: A Tribute to Ji?? Matou?ek
Ссылка на Издательство: Link
Поставляется из: Германии

The theory of quantum information

Автор: Watrous, John (university Of Waterloo, Ontario)
Название: The theory of quantum information
ISBN: 1107180562 ISBN-13(EAN): 9781107180567
Издательство: Cambridge Academ
Цена: 8626 р.
Наличие на складе: Поставка под заказ.

Описание: This largely self-contained book on the theory of quantum information focuses on precise mathematical formulations and proofs of fundamental facts that form the foundation of the subject. It is intended for graduate students and researchers in mathematics, computer science, and theoretical physics seeking to develop a thorough understanding of key results, proof techniques, and methodologies that are relevant to a wide range of research topics within the theory of quantum information and computation. The book is accessible to readers with an understanding of basic mathematics, including linear algebra, mathematical analysis, and probability theory. An introductory chapter summarizes these necessary mathematical prerequisites, and starting from this foundation, the book includes clear and complete proofs of all results it presents. Each subsequent chapter includes challenging exercises intended to help readers to develop their own skills for discovering proofs concerning the theory of quantum information.

Discrete Mathematical Structures: A Succinct Foundation

Автор: B. V. Senthil Kumar, Hemen Dutta
Название: Discrete Mathematical Structures: A Succinct Foundation
ISBN: 0367148692 ISBN-13(EAN): 9780367148690
Издательство: Taylor&Francis
Цена: 17875 р.
Наличие на складе: Поставка под заказ.

Описание: This book contains fundamental concepts on discrete mathematical structures in a crispy style so that learners could grasp the contents and explanation easily. The concepts of discrete mathematical structures have lot of applications in computer science, engineering and information technology including in coding techniques, switching circuits, pointers and linked allocation, error corrections, as well as in data networking, Chemistry, Biology and many other significant scientific areas. The book is for undergraduate and graduate levels learners and educators associated with various courses and progammes in Mathematics, Computer Science, Engineering and Information Technology. The book should serve as a text and reference guide to many undergraduate and graduate programmes of the disciplines mentioned above being offered by many institutions including colleges and universities. Readers will find solved examples and end of the chapter exercise in each chapter for practise and enhance the understanding of topics discussed. Features Gives comprehensive coverage of basic ideas of logic, mathematical induction, graph theory, Algebraic structures and Lattices and Boolean Algebra Provides lot of solved examples and at the end of each chapter, problems for practice are given to the readers Delivers materials on valid arguments and rules of inference is presented with lot of illustrations Focuses further on Algebraic structures so that the readers may know how to work with discrete structures, which are the abstract mathematical structures used to represent discrete objects and relationships between these objects

Fat chance :

Автор: Gross, Benedict H.,
Название: Fat chance :
ISBN: 1108728189 ISBN-13(EAN): 9781108728188
Издательство: Cambridge Academ
Цена: 2738 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: In a world where we are constantly being asked to make decisions based on incomplete information, facility with basic probability is an essential skill. This book provides a solid foundation in basic probability theory designed for intellectually curious readers and those new to the subject. Through its conversational tone and careful pacing of mathematical development, the book balances a charming style with informative discussion. This text will immerse the reader in a mathematical view of the world, giving them a glimpse into what attracts mathematicians to the subject in the first place. Rather than simply writing out and memorizing formulas, the reader will come out with an understanding of what those formulas mean, and how and when to use them. Readers will also encounter settings where probabilistic reasoning does not apply or where intuition can be misleading. This book establishes simple principles of counting collections and sequences of alternatives, and elaborates on these techniques to solve real world problems both inside and outside the casino. Pair this book with the HarvardX online course for great videos and interactive learning: https://harvardx.link/fat-chance.

Geometric regular polytopes

Автор: Mcmullen, Peter (university College London)
Название: Geometric regular polytopes
ISBN: 1108489583 ISBN-13(EAN): 9781108489584
Издательство: Cambridge Academ
Цена: 14380 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Regular polytopes and their symmetry have a long history stretching back two and a half millennia, to the classical regular polygons and polyhedra. Much of modern research focuses on abstract regular polytopes, but significant recent developments have been made on the geometric side, including the exploration of new topics such as realizations and rigidity, which offer a different way of understanding the geometric and combinatorial symmetry of polytopes. This is the first comprehensive account of the modern geometric theory, and includes a wide range of applications, along with new techniques. While the author explores the subject in depth, his elementary approach to traditional areas such as finite reflexion groups makes this book suitable for beginning graduate students as well as more experienced researchers.

MESH / A Journey Through Discrete Geometry

Автор: Janzen Beau, Polthier Konrad
Название: MESH / A Journey Through Discrete Geometry
ISBN: 3540284788 ISBN-13(EAN): 9783540284789
Издательство: Springer
Цена: 3459 р.
Наличие на складе: Поставка под заказ.

Описание: MESH is a mathematical video on polyhedral meshes and their role in geometry, numerics and computer graphics. The film is completely computer-generated using the latest technology and spans the range from ancient Greek mathematics to the area of geometric modelling of today. MESH has already won several science awards worldwide. The authors are Konrad Polthier, a professor of mathematics, and Beau Janzen, a professional film director.The film is an excellent teaching tool for courses on geometry, visualization, scientific computing and geometric modelling at universities and centres for computational science, and can be used in schools, too.

Combinatorial Algorithm Toolbox / An Interactive Course on Discrete Mathematics

Автор: HochstГ¤ttler W., Schliep A.
Название: Combinatorial Algorithm Toolbox / An Interactive Course on Discrete Mathematics
ISBN: 3540148876 ISBN-13(EAN): 9783540148876
Издательство: Springer
Цена: р.
Наличие на складе: Невозможна поставка.


Graph algorithms are easy to visualize and indeed there already exists a variety of packages to animate the dynamics when solving problems from graph theory. Still it can be difficult to understand the ideas behind the algorithm from the dynamic display alone.

CATBox consists of a software system for animating graph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. In the course book, intended for readers at advanced undergraduate or graduate level, computer exercises and examples replace the usual static pictures of algorithm dynamics.

For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows, weighted and unweighted matchings both for bipartite and non-bipartite graphs.

Find more information at http: //schliep.org/CATBox/.

Discrete Mathematics / Elementary and Beyond

Автор: LovГЎsz L., PelikГЎn J., Vesztergombi K.
Название: Discrete Mathematics / Elementary and Beyond
ISBN: 0387955844 ISBN-13(EAN): 9780387955841
Издательство: Springer
Цена: 7271 р.
Наличие на складе: Поставка под заказ.

Описание: Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures and exercises spread throughout the book.LГЎszlГі LovГЎsz is a Senior Researcher in the Theory Group at Microsoft Corporation. He is a recipient of the 1999 Wolf Prize and the GГ¶del Prize for the top paper in Computer Science. JГіzsef PelikГЎn is Professor of Mathematics in the Department of Algebra and Number Theory at EГ¶tvГ¶s LorГЎnd University, Hungary. In 2002, he was elected Chairman of the Advisory Board of the International Mathematical Olympiad. Katalin Vesztergombi is Senior Lecturer in the Department of Mathematics at the University of Washington.

Discrete mathematics 2/e

Автор: Biggs
Название: Discrete mathematics 2/e
ISBN: 0198507178 ISBN-13(EAN): 9780198507178
Издательство: Oxford Academ
Цена: 6778 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Includes chapters on statements and proof, logical framework, and natural numbers and the integers. This edition also features over 1000 tailored exercises and an accompanying website containing hints and solutions to all exercises. It is suitable for mathematicians and computer scientists seeking a first approach to this topic.

Probabilistic Methods for Algorithmic Discrete Mathematics

Автор: Habib
Название: Probabilistic Methods for Algorithmic Discrete Mathematics
ISBN: 3540646221 ISBN-13(EAN): 9783540646228
Издательство: Springer
Цена: 19056 р.
Наличие на складе: Поставка под заказ.

Описание: The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for graduate students and researchers.Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms; a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods); a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to exploit the structure of the underlying graph; a succinct treatment of randomized algorithms and derandomization techniques.

Invitation to discrete mathematics

Автор: Matousek, JinullЎ; Ne%setnullil, Jaroslav
Название: Invitation to discrete mathematics
ISBN: 0198570422 ISBN-13(EAN): 9780198570424
Издательство: Oxford Academ
Цена: 7395 р.
Наличие на складе: Поставка под заказ.

Описание: Invitation to Discrete Mathematics is an introduction and a thoroughly comprehensive text at the same time. A lively and entertaining style with mathematical precision and maturity uniquely combine into an intellectual happening and should delight the interested reader. A master example of teaching contemporary discrete mathematics, and of teaching science in general.

Название: Discrete Mathematics Applied to QSAR and Beyond
ISBN: 1439806624 ISBN-13(EAN): 9781439806623
Издательство: Taylor&Francis
Цена: 16638 р.
Наличие на складе: Поставка под заказ.

Описание: Summarizes results related to chemical structures that go beyond molecular stability and energetics, addressing such topics as molecular similarity, QSAR, QSPR characterization of DNA and proteins, as well as DNA and protein alignment. This title outlines molecular descriptors that considers aromaticity of benzenoid and non-benzenoid compounds.

A Journey Through Discrete Mathematics

Автор: Martin Loebl; Jaroslav Ne?et?il; Robin Thomas
Название: A Journey Through Discrete Mathematics
ISBN: 3319444786 ISBN-13(EAN): 9783319444789
Издательство: Springer
Цена: 17324 р.
Наличие на складе: Поставка под заказ.

Описание: This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiri Matousek, who passed away prematurely in March 2015.

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