The Discrete Math Workbook, Kurgalin

Автор: David Gries; Fred B. Schneider
Название: A Logical Approach to Discrete Math
ISBN: 1441928359 ISBN-13(EAN): 9781441928351
Издательство: Springer
Рейтинг:
Цена: 50770.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text attempts to change the way we teach logic to beginning students. Instead of teaching logic as a subject in isolation, we regard it as a basic tool and show how to use it. We strive to give students a skill in the propo- sitional and predicate calculi and then to exercise that skill thoroughly in applications that arise in computer science and discrete mathematics. We are not logicians, but programming methodologists, and this text reflects that perspective. We are among the first generation of scientists who are more interested in using logic than in studying it. With this text, we hope to empower further generations of computer scientists and math- ematicians to become serious users of logic. Logic is the glue Logic is the glue that binds together methods of reasoning, in all domains. The traditional proof methods -for example, proof by assumption, con- tradiction, mutual implication, and induction- have their basis in formal logic. Thus, whether proofs are to be presented formally or informally, a study of logic can provide understanding.

Автор: Liao Heng
Название: Mathematics for Future Computing and Communications
ISBN: 1316513580 ISBN-13(EAN): 9781316513583
Издательство: Cambridge Academ
Рейтинг:
Цена: 57030.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: New mathematical ideas go hand-in-hand with innovation in computing, communications and AI. Such innovations are described here in a book that provides a panorama of ideas and applications in computer architecture, software verification, quantum computing, compressed sensing, Bayesian inference, machine learning, reinforcement learning and more.

Автор: Chvatal, Vasek (concordia University, Montreal)
Название: Discrete mathematical charms of paul erdos
ISBN: 1108927408 ISBN-13(EAN): 9781108927406
Издательство: Cambridge Academ
Рейтинг:
Цена: 24280.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This captivating book provides an introduction to fundamental results of discrete mathematics through the work of Paul Erdos, blended with first-hand reminiscences of his work and life. Written for students, it covers topics ranging from Bertrand`s postulate to evolution of random graphs and topics not typically covered in introductory courses.

Автор: Godsil, Chris (university Of Waterloo, Ontario) Zhan, Hanmeng (simon Fraser University, British Columbia)
Название: Discrete quantum walks on graphs and digraphs
ISBN: 1009261681 ISBN-13(EAN): 9781009261685
Издательство: Cambridge Academ
Рейтинг:
Цена: 65470.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.

Автор: 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
Цена: 43330.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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

Автор: Schaefer
Название: Crossing Numbers Of Graphs
ISBN: 1498750494 ISBN-13(EAN): 9781498750493
Издательство: Taylor&Francis
Рейтинг:
Цена: 112290.00 T
Наличие на складе: Нет в наличии.
Описание: The first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science.

Автор: Edited by Lowell W. Beineke , Martin Charles Golum
Название: Topics in Algorithmic Graph Theory
ISBN: 1108492606 ISBN-13(EAN): 9781108492607
Издательство: Cambridge Academ
Рейтинг:
Цена: 95030.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.

Автор: Sudebkumar Prasant Pal; Ambat Vijayakumar
Название: Algorithms and Discrete Applied Mathematics
ISBN: 3030115089 ISBN-13(EAN): 9783030115081
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, held in Kharagpur, India, in February 2019.The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions.The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity.

Автор: Daniel J. Velleman
Название: How to Prove It : A Structured Approach
ISBN: 110842418X ISBN-13(EAN): 9781108424189
Издательство: Cambridge Academ
Рейтинг:
Цена: 99270.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proofs play a central role in advanced mathematics and theoretical computer science, and this bestselling text`s third edition will help students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs, with a new chapter on number theory and over 150 new exercises.

Автор: Lambers
Название: Graph Transformation
ISBN: 3319929909 ISBN-13(EAN): 9783319929903
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 11th International Conference on Graph Transformation, ICGT 2018, held as part of STAF 2018, in Toulouse, France, in June 2018. The 9 full papers, 2 short papers and 1 keynote presented in this book were carefully reviewed and selected from 16 submissions.

Автор: Rocio Gonzalez Diaz; Maria Jose Jimenez; Belen Gar
Название: Discrete Geometry for Computer Imagery
ISBN: 3642370667 ISBN-13(EAN): 9783642370663
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Stable length estimates of tube-like shapes.- The Complexity of Discrete Objects.- Optimal covering of a straight line applied to discrete convexity.- On dimension partitions in discrete metric spaces.- Walking in the Farey fan to Compute the Characteristics of a Discrete Straight Line Subsegment.- Persistent patterns in integer discrete circles.- Comparison of Point Clouds Acquired by 3d Scanner.- Generalized Simple Surface Points.- A parallel thinning algorithm for grayscale images.- New structures based on completions.- Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes.- Extremal connectedness of thin arithmetical discrete planes.- From the zones of influence of skeleton branch points to meaningful object parts.- Sufficient conditions for topological invariance of 2D images under rigid transformations.- The persistence space in multidimensional persistent homology.- Skeleton extraction of vertex sets lying on arbitrary triangulated 3D meshes.- Arc recognition on irregular isothetic grids and its application to reconstruction of noisy digital contour.- Reconstruction of quantitative properties from X-rays.- How to decompose a binary matrix into three convex polyominoes.- A method for feature detection in binary tomography.

Автор: Gregory J. Chaitin
Название: Exploring RANDOMNESS
ISBN: 1447110854 ISBN-13(EAN): 9781447110859
Издательство: Springer
Рейтинг:
Цена: 102480.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This essential companion to Chaitin`s successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The LISP code for this book is available at the author`s Web site together with a Java applet LISP interpreter.