Зарегистрироваться
Восстановить пароль
FAQ по входу

Дискретная математика

Ищем доверенных пользователей для раздела Математика

Вы компетентны в тематике этого раздела и имеете профессиональный опыт в данном направлении?
Вы хотите упорядочить имеющиеся здесь материалы и поддерживать порядок в будущем?
Вы готовы консультировать других пользователей?
Тогда вас, возможно, заинтересует возможность стать доверенным в этом разделе.

Смотри также

Теги, соответствующие этому тематическому разделу

Файлы, которые ищут в этом разделе

Доверенные пользователи и модераторы раздела

New Age International, 2009. — 408 p. — ISBN 978-81-224-2607-6. The salient features of this book include: strong coverage of key topics involving recurrence relation, combinatorics, Boolean algebra, graph theory and fuzzy set theory. Algorithms and examples integrated throughout the book to bring clarity to the fundamental concepts. Each concept and definition is followed by...
  • №1
  • 10,70 МБ
  • дата добавления неизвестна
  • изменен
New Age International, 2005. - 264 pages. ISBN: 8122416926 Salient Features Mathematical logic, fundamental concepts, proofs and mathematical induction (Chapter 1) Set theory, fundamental concepts, theorems, proofs, Venn diagrams, product of sets, application of set theory and fundamental products (Chapter 2) An introduction to binary relations and concepts, graphs, arrow...
  • №2
  • 3,73 МБ
  • добавлен
  • изменен
Springer, 2014. — 304 p. — (Foundations in Signal Processing, Communications and Networking; 10). — ISBN 978-3-319-05479-7. Classical information processing consists of the main tasks gaining knowledge, storage, transmission, and hiding data. The first named task is the prime goal of Statistics and for the two next Shannon presented an impressive mathematical theory, called...
  • №3
  • 2,34 МБ
  • добавлен
  • изменен
New York: Springer, 2017. — 388 p. — (Foundations in Signal Processing, Communications and Networking; 13). — ISBN 978-3-319-53137-3. The fourth volume of Rudolf Ahlswede's lectures on Information Theory is focused on Combinatorics. Rudolf Ahlswede's original motivation to study combinatorial aspects of Information Theory problems were zero-error codes: in this case the structure...
  • №4
  • 3,04 МБ
  • добавлен
  • изменен
Springer, 2019. — 581 p. — (Foundations in Signal Processing, Communications and Networking 15). — ISBN 978-3-030-00310-4. The fifth volume of Rudolf Ahlswede’s lectures on Information Theory focuses on several problems that were at the heart of a lot of his research. One of the highlights of the entire lecture note series is surely Part I of this volume on arbitrarily varying...
  • №5
  • 7,59 МБ
  • добавлен
  • изменен
Springer, 2015. — 471 p. — (Foundations in Signal Processing, Communications and Networking; 11). — ISBN 978-3-319-12522-0. Classical information processing consists of the main tasks of gaining knowledge, storage, transmission, and hiding data. The first named task is the prime goal of Statistics and for the next two Shannon presented an impressive mathematical theory, called...
  • №6
  • 4,36 МБ
  • добавлен
  • изменен
Springer, 2006. — 1137 p. — (Lecture Notes in Computer Science, v. 4123). — ISBN 3-540-46244-9. The Center for Interdisciplinary Research (ZiF) of the University of Bielefeld hosted a research group under the title General Theory of Information Transfer and Combinatorics, abbreviated as GTIT-C, from October 1, 2001 to September 30, 2004. As head of the research group the editor...
  • №7
  • 9,46 МБ
  • добавлен
  • изменен
John Wiley, 1987. — 296 p. — (Wiley-Interscience series in discrete mathematics and optimization). — ISBN 0-471-90825-8. Over the past thirty years there has been an increasing number of contributions to the topic of searching, both in theoretically as well as in applications- oriented journals. It is remarkable that very different kinds of problems are classified as search...
  • №8
  • 2,03 МБ
  • добавлен
  • изменен
Springer, 2007. — 569 p. — (Graduate Texts in Mathematics). — ISBN 978-3-540-39035-0. The text is divided into three parts: Basics, Methods, and Topics. This should enable the reader to understand what combinatorial enumeration is all about, to apply the basic tools to almost any problem he or she may encounter, and to proceed to more advanced methods and some attractive and...
  • №9
  • 3,62 МБ
  • добавлен
  • изменен
John Wiley & Sons, 1988. — 372 p. — (Wiley Teubner Series on Applicable Theory in Computer Science, Book 6). — ISBN 0-471-92142-4. The purpose of this book is to give an introduction to the basic ideas (Chapter 1) and present a collection of the most interesting instances of search problems (Chapters 2-6). At the beginning the scope of combinatorial search is spelled out (roughly...
  • №10
  • 2,64 МБ
  • добавлен
  • изменен
Springer, 1979. — 492 p. — ISBN 3-540-61787-6. The present book covers most aspects of parts (a) and (b), but none of (c). The reasons for excluding (c) were twofold. First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on...
  • №11
  • 6,71 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2009. — 586 p. — (Mathematical Sciences Research Institute Publications). — ISBN 0-521-86134-9. Highlights include some of Aaron N. Siegel’s groundbreaking work on loopy games, the unveiling by Eric J. Friedman and Adam S. Landsberg of the use of renormalization to give very intriguing results about Chomp, and Teigo Nakamura’s Counting...
  • №12
  • 3,45 МБ
  • добавлен
  • изменен
John Wiley, 1988. — 552 p. — ISBN 0-471-84902-2. Here is a first-year course in discrete mathematics, requiring no calculus or computer programming experience, for students on computer science and mathematics courses. The approach stresses finding efficient algorithms, rather than existential results. It provides an introduction to constructing proofs (especially by induction),...
  • №13
  • 5,85 МБ
  • добавлен
  • изменен
Springer, 2018. — 258 p. — ISBN 3319978454. This book offers a comprehensive and accessible exposition of Euclidean Distance Matrices (EDMs) and rigidity theory of bar-and-joint frameworks. It is based on the one-to-one correspondence between EDMs and projected Gram matrices. Accordingly the machinery of semidefinite programming is a common thread that runs throughout the book. As...
  • №14
  • 3,01 МБ
  • добавлен
  • изменен
3rd ed. — Wiley, 2008. — 373 p. — (Wiley-Interscience Series in Discrete Mathematics and Optimization). — ISBN 978-0470170205. This Third Edition of The Probabilistic Method reflects the most recent developments in the field while maintaining the standard of excellence that established this book as the leading reference on probabilistic methods in combinatorics. Maintaining its...
  • №15
  • 7,77 МБ
  • добавлен
  • изменен
3rd ed. — Wiley, 2008. — 373 p. — (Wiley-Interscience Series in Discrete Mathematics and Optimization). — ISBN: 9780470170205 This Third Edition of The Probabilistic Method reflects the most recent developments in the field while maintaining the standard of excellence that established this book as the leading reference on probabilistic methods in combinatorics. Maintaining its...
  • №16
  • 3,48 МБ
  • добавлен
  • изменен
4th edition. — Hoboken: Wiley, 2016. — 384 p. — (Wiley Series in Discrete Mathematics and Optimization) — ISBN 978-1119061953. Maintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating...
  • №17
  • 2,40 МБ
  • добавлен
  • изменен
World Scientific Publishing, 2011. — 465 p. — (World Scientific Series on Nonlinear Science, Series А). — ISBN 978-9814343633. Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses...
  • №18
  • 37,93 МБ
  • добавлен
  • изменен
Springer, 2001. — 197 p. — (Lecture Notes in Computer Science, v. 2122). — ISBN 3-540-42775-9. In order to speed up doctoral education in Germany the Deutsche Forschungsgemeinschaft (DFG, German Research Association) in the late 1980s developed a new funding concept for graduate programs called Graduiertenkollegs. Groups of university teachers could join together and submit...
  • №19
  • 1,07 МБ
  • добавлен
  • изменен
Springer, 2001. — 200 p. — (Springer Undergraduate Mathematics Series). — ISBN 1-85233-236-0. Counting and Binomial Coefficients. Recurrence. Introduction to Graphs. Travelling Round a Graph. tions and Colourings. The Inclusion-Exclusion Principle. Latin Squares and Hall's Theorem. Schedules and 1-Factorisations. Introduction to Designs. Appendix. Solutions. Further Reading....
  • №20
  • 1,48 МБ
  • дата добавления неизвестна
  • изменен
Springer, 2002. — 200 p. — (Springer Undergraduate Mathematics Series). — ISBN-10 1852332360; ISBN-13 978-1852332365. Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he...
  • №21
  • 6,67 МБ
  • добавлен
  • изменен
Springer, 1981. — 228 p. — (Texts and Monographs in Computer Science). — ISBN 3‐540‐90573‐1. Классическая книга по основным понятиям алгоритмов, дискретной математики и теоретического программирования. Рассмотрены основные объекты и алгоритмы. Рассчитана на читателей с базовой математической подготовкой. Sets, Maps, and Relations Induction, Strings, and Language Counting,...
  • №22
  • 8,51 МБ
  • добавлен
  • изменен
ISTE Ltd and John Wiley & Sons, 2010. — 915 p. — ISBN 1848211961. How many ways do exist to mix different ingredients, how many chances to win a gambling game, how many possible paths going from one place to another in a network ? To this kind of questions Mathematics applied to computer gives a stimulating and exhaustive answer. This text, presented in three parts (Combinatorics,...
  • №23
  • 16,70 МБ
  • добавлен
  • изменен
Springer, 2013. — 118 p. — ISBN-10: 3319017500 Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational...
  • №24
  • 3,65 МБ
  • добавлен
  • изменен
Chapman and Hall/CRC, 2019. — 534 р. Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level. This book presents the basics of Discrete Mathematics and its applications to day-to-day problems in several areas. This book is intended for undergraduate students of Computer Science, Mathematics and Engineering....
  • №25
  • 3,10 МБ
  • добавлен
  • изменен
Dover, 2010. — 256 pages. ISBN: 0486691152 This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. Geared toward mathematics and computer science majors, it emphasizes applications, offering more than 200 exercises to help students test their grasp of the material and...
  • №26
  • 6,22 МБ
  • добавлен
  • изменен
Dover Publications, 2010. — 251 p. — (Dover Books on Computer Science). — ISBN: 0486691152 OCR, электронное оглавление. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to...
  • №27
  • 8,07 МБ
  • добавлен
  • изменен
L.: Dover Publications, 2010. - 251p. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the...
  • №28
  • 21,67 МБ
  • добавлен
  • изменен
Providence: American Mathematical Society, 2015. — 316 p. Contents: Geometric error correcting codes On products and powers of linear codes under componentwise multiplication Higher weights of affine Grassmann codes and their duals Algorithmic: Special varieties The geometry of efficient arithmetic on elliptic curves 2–2–2 isogenies between Jacobians of hyperelliptic curves Easy...
  • №29
  • 2,10 МБ
  • добавлен
  • изменен
Springer, 2013. - 300 pages. ISBN: 8132210522 This book consists of eighteen articles in the area of `Combinatorial Matrix Theory' and `Generalized Inverses of Matrices'. Original research and expository articles presented in this publication are written by leading Mathematicians and Statisticians working in these areas. The articles contained herein are on the following...
  • №30
  • 5,87 МБ
  • добавлен
  • изменен
Cambridge University Press, 2010. — 703 p. This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda...
  • №31
  • 4,44 МБ
  • добавлен
  • изменен
Springer, 2018. — 238 p. This book discusses Moore finite state machines (FSMs) implemented with field programmable gate arrays (FPGAs) including look-up table (LUT) elements and embedded memory blocks (EMBs). To minimize the number of LUTs in FSM logic circuits, the authors propose replacing a state register with a state counter. They also put forward an approach allowing linear...
  • №32
  • 6,33 МБ
  • добавлен
  • изменен
Bellin: Springer, 2011. - 424p. Contents : Front Matter Un'Introduzione Alla Teoria Delle Funzioni Di Möbius Some Remarks on the Critical Problem The Tutte Polynomial Part I: General Theory On 3-Connected Matroids and Graphs The Poset of Subpartitions and Cayley's Formula for the Complexity of a Complete Graph Engineering Applications of Matroids - A Survey Matroids...
  • №33
  • 15,44 МБ
  • добавлен
  • изменен
N.-Y.: Walter de Gruyter, 2015. - 376p. Cryptography has become essential as bank transactions, credit card infor-mation, contracts, and sensitive medical information are sent through inse-cure channels. This book is concerned with the mathematical, especially algebraic, aspects of cryptography. It grew out of many courses presented by the authors over the past twenty years at...
  • №34
  • 2,25 МБ
  • добавлен
  • изменен
New York: Springer, 1992. — 234 p. The papers in this volume are the result of a workshop held in January 1989 at the Mathematical Sciences Research Institute. Topics covered include decision problems, finitely presented simple groups, combinatorial geometry and homology, and automatic groups and related topics. Contents : Front Matter Decision Problems for Groups — Survey and...
  • №35
  • 15,40 МБ
  • добавлен
  • изменен
Providence: American Mathematical Society, 2009. - 267p. Mathematics has been called the science of order. The subject is remarkably good for generalizing specific cases to create abstract theories. However, mathematics has little to say when faced with highly complex systems, where disorder reigns. This disorder can be found in pure mathematical arenas, such as the...
  • №36
  • 1,49 МБ
  • добавлен
  • изменен
CRC Press, 2012. — 538 pages. — ISBN: 1466504994 Containing exercises and materials that engage students at all levels, Discrete Mathematics with Ducks presents a gentle introduction for students who find the proofs and abstractions of mathematics challenging. This classroom-tested text uses discrete mathematics as the context for introducing proofwriting. Facilitating...
  • №37
  • 11,85 МБ
  • добавлен
  • изменен
Academic Press, 1970. — 252. The development of the electronic computer has profoundly and irrevocably changed the scientific world. In so doing it has simultaneously created numerous opportunities for the application of mathematical ideas and methods to the solution of traditional scientific problems and made possible the exploration of research areas in mathematics and the...
  • №38
  • 2,53 МБ
  • добавлен
  • изменен
Dover Publications, 2004. — 245 p. Discrete mathematics is an essential tool in almost all subareas of computer science. In- teresting and challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, AI, theoretical computer science, and other areas. The course. The University of California,...
  • №39
  • 1,36 МБ
  • добавлен
  • изменен
Edward A. Bender & S. Gill Williamson, 2005. — 256 p. —– ISBN: 0486442500 Discrete mathematics is fundamental to computer science, and interesting, challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, artificial intelligence, theoretical computer science, and elsewhere. This...
  • №40
  • 1,93 МБ
  • добавлен
  • изменен
The Great Courses, 2009. — 262 p. Discrete mathematics can be described as an advanced look at the mathematics that we learned as children. In elementary school, we learned to count, did basic arithmetic, and amused ourselves with solving puzzles, ranging from connecting the dots, to coloring, to more sophisticated creative pursuits. So what exactly is discrete mathematics?...
  • №41
  • 1,12 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2010, -249 pp. This book is issued from a previous book of the authors, entitled Rational Series and their Languages. The present text is an entirely rewritten, and enriched version of this book. An important part of the material presented here appears for the first time in book form. The text served for advanced courses held several...
  • №42
  • 1,99 МБ
  • добавлен
  • изменен
Издательство Springer, 2006, -148 pp. This book is an introduction to rational formal power series in several noncommutative variables and their relations to formal languages and to the theory of codes. Formal power series have long been used in all branches of mathematics. They are invaluable in enumeration and combinatorics. For this reason, they are useful in various...
  • №43
  • 870,39 КБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2016. - 497 p. Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important concepts, providing a clear exposition of some recent results, and emphasise the emerging connections between these different fields. Topics include...
  • №44
  • 4,08 МБ
  • добавлен
  • изменен
Cambridge University Press, 2 ed., Vol. 1, 1999 – 1100 p. - This is the first volume of a two-volume text on design theory. Since the first edition, there has been extensive development of the theory. In particular, the growing importance of discrete mathematics to many parts of engineering and science has made designs a useful tool for applications. The authors acknowledge this...
  • №45
  • 5,90 МБ
  • добавлен
  • изменен
Cambridge University Press, 2 ed., Vol. 2, 1999 – 1100 p. - This volume concludes the second edition of the standard text on design theory. Since the first edition there has been extensive development of the theory and this book has been thoroughly rewritten to reflect this. In particular, the growing importance of discrete mathematics to many parts of engineering and science have...
  • №46
  • 14,02 МБ
  • добавлен
  • изменен
Springer, 2018. — 308 p. — (Research in Mathematics Education). — ISBN 978-3-319-90691-1. The emerging foundation of research on thinking about integers highlights students’ sophisticated reasoning about integers, demonstrated even by young children, and critical nonconventional conceptions that they can develop if integers are ignored. Understanding children’s thinking about...
  • №47
  • 5,44 МБ
  • добавлен
  • изменен
Springer, 2018. — 308 p. — (Research in Mathematics Education). — ISBN 978-3-319-90691-1. The emerging foundation of research on thinking about integers highlights students’ sophisticated reasoning about integers, demonstrated even by young children, and critical nonconventional conceptions that they can develop if integers are ignored. Understanding children’s thinking about...
  • №48
  • 3,24 МБ
  • добавлен
  • изменен
Издательство North Holland, 1988, -419 pp. Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös The 1988 Cambridge Combinatorial Conference was held at Trinity College, Cambridge, from 21 to 25 March 1988, under the auspices of the London Mathematical Society, the Department of Pure Mathematics and Mathematical Statistics of Cambridge University and...
  • №49
  • 3,00 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1986, -187 pp. This book is an expanded account of a first-year graduate course in combinatorics, given at Louisiana State University, Baton Rouge during the fall semester of 1985. The traditional ingredients of an initial combinatorics course seem to be combinatorial identities and generating functions, with some introductory design...
  • №50
  • 1,39 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2006, -336 pp. Качество среднее (бледный текст). Percolation theory was founded by Broadbent and Hammersley almost half a century ag: by now thousands of papers and many books have been devoted to the subject. The original aim was to open up to mathematical analysis the study of random physical processes such as the flow of through a...
  • №51
  • 4,83 МБ
  • добавлен
  • изменен
Springer, 1995. — 316 p. — (Tutorial Guides in Computing and Information Systems). — ISBN: 0412562804, 9780412562808 The purpose of this text is to teach the novice the foundations of discrete mathematics as applied to computing. Illustrative examples are given throughout the book, followed by exercises which should provide an understanding and an appreciation of the...
  • №52
  • 6,27 МБ
  • добавлен
  • изменен
Kluwer, 1984. — 207. The roots of the project which culminates with the writing this book can be traced to the work on logic synthesis started in 1979 the IBM Watson Research Center and at University of California, Berkeley. During the preliminary phases of these projects, the importance of logic minjmization for the synthesis of area and performance effective circuits clearly...
  • №53
  • 5,56 МБ
  • добавлен
  • изменен
Издательство Springer, 2013, -134 pp. Hypergraphs are systems of finite sets and form, probably, the most general concept in discrete mathematics. This branch of mathematics has developed very rapidly during the latter part of the twentieth century, influenced by the advent of computer science. Many theorems on set systems were already known at the beginning of the twentieth...
  • №54
  • 806,71 КБ
  • добавлен
  • изменен
Springer, 2017. — 281 p. — (Lecture Notes in Computer Science). — ISBN 10 331966395X, 13 978-3319663951. The 21 revised full papers presented together with 5invoted talks were carefully reviewed and selected from 26 submissions. Discrete geometry plays an expanding role in the fields of shape modeling, image synthesis, and image analysis. It deals with topological and geometrical...
  • №55
  • 7,49 МБ
  • добавлен
  • изменен
Los Angeles: USCD, 2012. - 348p. The material in this unit of study was, over several years, presented by the authors to lower division undergraduates in the Department of Mathematics and the Department of Computer Science and Engineering at the University of California, San Diego (UCSD). All material has been classroom tested by the authors and other faculty members at UCSD.
  • №56
  • 4,51 МБ
  • добавлен
  • изменен
Los Angeles: USCD, 2015. - 331p. The material in this unit of study was, over several years, presented by the authors to lower division undergraduates in the Department of Mathematics and the Department of Computer Science and Engineering at the University of California, San Diego (UCSD). All material has been classroom tested by the authors and other faculty members at UCSD.
  • №57
  • 3,28 МБ
  • добавлен
  • изменен
Springer, 2013. — 214 p. Imagine walking along a beach, looking for seashells. Each seashell you unearth is precious and exquisite, with its own unique beauty. Discovering the connections between different areas of mathematics is much the same. There are treasures to be found in applying one field to another in unexpected ways. This text is intended for graduate and upper...
  • №58
  • 1,13 МБ
  • добавлен
  • изменен
Providence: American Mathematical Society, 2010. — 278 p. This volume contains a collection of papers presented at the international conference IPM 20--Combinatorics 2009, which was held at the Institute for Research in Fundamental Sciences in Tehran, Iran, May 15-21, 2009. The conference celebrated IPM's 20th anniversary and was dedicated to Reza Khosrovshahi, one of the founders...
  • №59
  • 3,85 МБ
  • добавлен
  • изменен
Springer, 2018. — 189 p. — (Lecture Notes in Mathematics 2209). — ISBN 3319740385. This book establishes the foundations of the theory of bounded and unbounded weighted composition operators in L2-spaces. It develops the theory in full generality, meaning that the corresponding composition operators are not assumed to be well defined. A variety of seminormality properties of...
  • №60
  • 2,80 МБ
  • добавлен
  • изменен
World Scientific Publishing Europe Ltd., 2016. — 182 p. — (LTCC Advanced Mathematics Series. Volume 3) — ISBN: 9781786340290 The London Taught Course Centre (LTCC) for PhD students in the Mathematical Sciences has the objective of introducing research students to a broad range of advanced topics. For some students, these topics might include one or two in areas directly related...
  • №61
  • 1,33 МБ
  • добавлен
  • изменен
Springer, 1997. — xxiii, 618 p. — (Grundlehren der mathematischen Wissenschaften, 315). — ISBN 978-3-662-03338-8. The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for...
  • №62
  • 4,57 МБ
  • добавлен
  • изменен
Cambridge University Press, 2018. — 367 p. — ISBN 978-1-107-15398-1. Discrete mathematics has been rising in prominence in the past fifty years, both as a tool with practical applications and as a source of new and interesting mathematics. The topics in discrete mathematics have become so well developed that it is easy to forget that common threads connect the different areas, and...
  • №63
  • 9,17 МБ
  • добавлен
  • изменен
Cambridge University Press, 2017. — 472 p. — ISBN 978-1-107-06237-5. Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in...
  • №64
  • 5,30 МБ
  • добавлен
  • изменен
L.: Springer, 2001. - 253 p. This volume contains the papers presented at the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS1), which was held at 'Ovidius'University Constantza, Romania in July 2001. The conference was open to all areas of discrete mathematics and theoretical computer science, and the papers contained within this volume cover...
  • №65
  • 10,68 МБ
  • добавлен
  • изменен
Springer, 2011. — 248 p. — ISBN: 0857295993, 9780857296009 Written for students taking a second or third year undergraduate course in mathematics or computer science, this book is the ideal companion to a course in enumeration. Enumeration is a branch of combinatorics where the fundamental subject matter is numerous methods of pattern formation and counting. Introduction to...
  • №66
  • 1,36 МБ
  • добавлен
  • изменен
Springer Science+Business Media LLC, 2017. — 620 p. — (The IMA Volumes in Mathematics and its Applications 161) — ISBN 9781493970049. This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute of Mathematics and its Applications during the Spring 2015 where geometric analysis,...
  • №67
  • 6,19 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2012. - 352p. Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key...
  • №68
  • 2,36 МБ
  • добавлен
  • изменен
Cambridge University Press, 2018. — 589 p. — (Cambridge Studies in Advanced Mathematics, 172). — ISBN 978-1-107-18233-2. This self-contained book introduces readers to discrete harmonic analysis with an emphasis on the Discrete Fourier Transform and the Fast Fourier Transform on finite groups and finite fields, as well as their noncommutative versions. It also features...
  • №69
  • 6,42 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2018. — 235 p. — (Advanced Courses in Mathematics - CRM Barcelona). — ISBN 978-3-319-70156-1. Homological algebra is a ubiquitous subject: it is both an active field of research in its own right and a widespread toolbox for many mathematicians. As time passes, there is the danger that, while the amount of knowledge increases, it may split into...
  • №70
  • 2,29 МБ
  • добавлен
  • изменен
Macquarie University, Sydney, 1982, -190 pp. This set of notes has been compiled over a period of more than 25 years. Chapters 1-4 were used in various forms and on many occasions between 1981 and 1990 by the author at Imperial College, University of London. An extra 14 chapters were written in Sydney in 1991 and 1992. Chapters 7 and 12 were added in 1997. The material has...
  • №71
  • 1,21 МБ
  • добавлен
  • изменен
Издательство Springer, 2011, -114 pp. The monograph is devoted to theoretical and experimental study of decision trees with a focus on minimizing the average time complexity. The study resulted in upper and lower bounds on the minimum average time complexity of decision trees for identification problems. Previously known bounds from information theory are extended to the case...
  • №72
  • 975,04 КБ
  • добавлен
  • изменен
New Delhi: Hindustan Book Agency, 2009. — 189 p. The concept of a graph is fundamental in mathematics since it conveniently encodes diverse relations and facilitates combinatorial analysis of many complicated counting problems. In this book, the authors have traced the origins of graph theory from its humble beginnings of recreational mathematics to its modern setting for modeling...
  • №73
  • 1,90 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2011, -711 pp. Boolean functions, meaning {0,1}-valued functions of a finite number of {0,1}- valued variables, are among the most fundamental objects investigated in pure and applied mathematics. Their importance can be explained by several interacting factors. It is reasonable to argue that a multivariate function f :A1×A2×. . .×An→...
  • №74
  • 4,54 МБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 2001, -119 pp. This book presents a nearly complete classification of various restricted classes of computational problems called Boolean constraint satisfaction problems. Roughly, these are problems whose instances describe a collection of simple constraints on Boolean variables. A typical goal would be to find a setting to the...
  • №75
  • 1,06 МБ
  • добавлен
  • изменен
Издательство Springer, 2008, -326 pp. In October 2006, the editors of this volume organized a Dagstuhl Seminar on Complexity of Constraints at the Schloss Dagstuhl Leibniz Center for Informatics inWadern, Germany. This event consisted of both invited and contributed talks by some of the approximately 40 participants, as well as problem sessions and informal discussions. After...
  • №76
  • 2,41 МБ
  • добавлен
  • изменен
Издательство Springer, 2007, -261 pp. János Bolyai Mathematical Society. The present volume is a collection of survey papers in the fields given in the title. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and...
  • №77
  • 1,51 МБ
  • добавлен
  • изменен
Издательство Academic Press, 1983, -401 pp. An international meeting devoted to the theme of Combinatorics on Words was held at the University of Waterloo, Canada during the week of August 16-22, 1982. There were 10 invited speakers and 23 contributed papers. Robert McNaughton has written that "the phenomenon underlying the call to this conference is the emergence of a theory...
  • №78
  • 4,58 МБ
  • добавлен
  • изменен
Springer, 2018. — 515 p. — (Springer Optimization and Its Applications 131). — ISBN 3319743244. A variety of modern research in analysis and discrete mathematics is provided in this book along with applications in cryptographic methods and information security, in order to explore new techniques, methods, and problems for further investigation. Distinguished researchers and...
  • №79
  • 5,95 МБ
  • добавлен
  • изменен
Springer, 2018. — 515 p. — (Springer Optimization and Its Applications 131). — ISBN 978-3-319-74325-7. A variety of modern research in analysis and discrete mathematics is provided in this book along with applications in cryptographic methods and information security, in order to explore new techniques, methods, and problems for further investigation. Distinguished researchers and...
  • №80
  • 14,06 МБ
  • добавлен
  • изменен
Издательство Academic Press, 1983, -435 pp. Theoretical computer science is the mathematical study of models of computation. As such, it originated in the 1930s, well before the existence of modern computers, in the work of the logicians Church, Godel, Kleene, Post, and Turing. This early work has had a profound influence on the practical and theoretical development of computer...
  • №81
  • 2,47 МБ
  • добавлен
  • изменен
Springer, 2012. - 97 p. ISBN: 1461441897 Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements...
  • №82
  • 3,22 МБ
  • добавлен
  • изменен
McGraw-Hill, 1994. — 597 p. Computer-aided design (CAD) of digital circuits has been a topic of great importance in the last two decades, and the interest in this field is expected to grow in the coming years. Computer-aided techniques have provided the enabling methodology to design efficiently and successfully large-scale high-performance circuits for a wide spectrum of...
  • №83
  • 19,59 МБ
  • добавлен
  • изменен
McGraw-Hill, 1994. — 597 p. Computer-aided design (CAD) of digital circuits has been a topic of great importance in the last two decades, and the interest in this field is expected to grow in the coming years. Computer-aided techniques have provided the enabling methodology to design efficiently and successfully large-scale high-performance circuits for a wide spectrum of...
  • №84
  • 6,39 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1995, -254 pp. Free-choice Petri nets have been around for more than twenty years, and are a successful branch of net theory. Nearly all the introductory texts on Petri nets devote some pages to them. This book is intended for those who wish to go further. It brings together the classical theorems of free-choice theory obtained by...
  • №85
  • 1,71 МБ
  • добавлен
  • изменен
Springer, 2012. — 668 p. — 2nd ed. — ISBN: 3642309577, This updated and revised second edition of the leading reference volume on distance metrics includes a wealth of new material that reflects advances in a field now regarded as an essential tool in many areas of pure and applied mathematics. The publication of this volume coincides with intensifying research efforts into...
  • №86
  • 3,52 МБ
  • добавлен
  • изменен
4th Edition. — Springer-Verlag, Berlin, Heidelberg, 2016. — 757 p. — ISBN: 9783662528433 In 2016,one decade after the publication of our Dictionary of Distances, the number of WWW entries offered by Google on the topics “distance” and “distance metric” has grown from 300 million (about 4% of all entries) and 12 million to 1:35 billion (about 5:4% of all entries) and 114...
  • №87
  • 6,50 МБ
  • добавлен
  • изменен
Издательство Springer, 2010, -579 pp. Cuts and metrics are well-known and central objects in graph theory, combinatorial optimization and, more generally, discrete mathematics. They also occur in other areas of mathematics and its applications such as distance geometry, the geometry of numbers, combinatorial matrix theory, the theory of designs, quantum mechanics, statistical...
  • №88
  • 10,92 МБ
  • добавлен
  • изменен
4th Ed. — Springer-Verlag, 2016. — 1145 p. — ISBN 3662528436 This 4-th edition of the leading reference volume on distance metrics is characterized by updated and rewritten sections on some items suggested by experts and readers, as well a general streamlining of content and the addition of essential new topics. Though the structure remains unchanged, the new edition also explores...
  • №89
  • 4,59 МБ
  • добавлен
  • изменен
Cambridge University Press, 2008. — 290 p. Nearly a hundred years have passed since Viggo Brun invented his famous sieve, and yet the use of sieve methods is still evolving. At one time it seemed that, as analytic tools improved, the use of sieves would decline, and only their role as an auxiliary device would survive. However, as probability and combinatorics have penetrated the...
  • №90
  • 18,09 МБ
  • добавлен
  • изменен
Berlin: Walter de Gruyter GmbH, 2016. — 354 p. This book is based on courses taught by the authors over many years at universities in Dortmund, Hamburg, Munich, and Stuttgart. Essentially, no knowledge beyond high school mathematics is required for reading this book. However, the density of the presentation suggests a certain amount of mathematical maturity, as, for example,...
  • №91
  • 2,45 МБ
  • добавлен
  • изменен
New York: Springer, 2016. - 629 p. This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The 50 revised full papers papers presented in this book were carefully reviewed and selected from various submissions. The papers cover various topics including:...
  • №92
  • 14,60 МБ
  • добавлен
  • изменен
New York: Springer, 2015. - 735p. This textbook addresses the mathematical description of sets, categories, topologies and measures, as part of the basis for advanced areas in theoretical computer science like semantics, programming languages, probabilistic process algebras, modal and dynamic logics and Markov transition systems. Using motivations, rigorous definitions, proofs...
  • №93
  • 8,70 МБ
  • добавлен
  • изменен
University of Massachusetts, 2016. — 377 p. As a general description one could say that discrete mathematics is the mathematics that deals with “separated” or discrete sets of objects rather than with continuous sets such as the real line. For example, the graphs that we learn to draw in high school are of continuous functions. Even though we might have begun by plotting...
  • №94
  • 3,55 МБ
  • добавлен
  • изменен
New York: Springer, 2003. — 229 p. Introduction and Motivation Definition and Formulation of the DOMP Several Linearisations of the Quadratic Formulation ( DOMP ) A Specific Branch-and-Bound Method Heuristic Procedures Particular Cases and Related Problems Extension to the Capacitated Case Conclusions and Further Research Back Matter
  • №95
  • 6,32 МБ
  • добавлен
  • изменен
Addison Wesley, 2001. - 600 pages. For one or two term introductory courses in discrete mathematics. This book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques with woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to...
  • №96
  • 26,89 МБ
  • дата добавления неизвестна
  • изменен
Springer, 1998. — 205 p. Within the last 10-13 years Binary Decision Diagrams (BDDs) have become the state-of-the-art data structure in VLSI CAD for representation and manipulation of Boolean functions. Today, BDDs are widely used and in the meantime have also been integrated in commercial tools, especially in the area of verification and synthesis. The interest in BDDs...
  • №97
  • 2,91 МБ
  • добавлен
  • изменен
Birkhäuser Basel, 2004. - 554 pages. This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied...
  • №98
  • 5,34 МБ
  • дата добавления неизвестна
  • изменен
Издательство Springer, 2013, -134 pp. As a combinatorial subject, the connected dominating set has been studied in as early as 1970s. However, it was not a major subject and hence did not attract much attention. This situation had changed since 1998 due to its important applications in communication and computer networks, especially its role as a virtual backbone in wireless...
  • №99
  • 1,24 МБ
  • добавлен
  • изменен
Springer, 2005. — 225 p. VLSI CAD has greatly benefited from the use of reduced ordered Binary Decision Diagrams (BDDs) and the clausal representation as a problem of Boolean Satisfiability (SAT), e.g. in logic synthesis, verification or design-for-testability. In recent practical applications, BDDs are optimized with respect to new objective functions for design space...
  • №100
  • 3,51 МБ
  • добавлен
  • изменен
Strasbourg: European Mathematical Society, 2015. — 468 p. Since the seminal works of Gian-Carlo Rota and his school in the 1960s, combinatorics has become a respected branch of modern mathematics. Today it appears at the intersection of a wide variety of mathematical sciences. In fact, techniques and methods from combinatorics have become indispensable in such diverse areas as,...
  • №101
  • 3,30 МБ
  • добавлен
  • изменен
Издательство Springer, 1987, -439 pp. Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem...
  • №102
  • 4,52 МБ
  • добавлен
  • изменен
Berlin: Springer, 2016. - 468p. This book is a comprehensive explanation of graph and model transformation. It contains a detailed introduction, including basic results and applications of the algebraic theory of graph transformations, and references to the historical context. Then in the main part the book contains detailed chapters on M-adhesive categories, M-adhesive...
  • №103
  • 15,54 МБ
  • добавлен
  • изменен
Hoboken: Wiley, 2006. — xii + 691 p. — ISBN 9780471476023., 0471476021. Did you know that games and puzzles have given birth to many of today's deepest mathematical subjects? Now, with Douglas Ensley and Winston Crawley's Introduction to Discrete Mathematics, you can explore mathematical writing, abstract structures, counting, discrete probability, and graph theory, through games,...
  • №104
  • 122,33 МБ
  • добавлен
  • изменен
Brooks Cole, 2010. - 984 pages. 4 edition Susanna Epp's "Discrete Mathematics with Applications" provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies...
  • №105
  • 9,73 МБ
  • дата добавления неизвестна
  • изменен
Brooks Cole, 2003. — 928 pages. Susanna Epp's Discrete Mathematics, Third edition provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought....
  • №106
  • 47,76 МБ
  • дата добавления неизвестна
  • изменен
4th ed — Boston: Cengage Learning, 2011. — 656 p. — ISBN: 9780495826170 The book is appropriate for use in a discrete mathematics course that emphasizes essential topics or in a mathematics major or minor course that serves as a transition to abstract mathematical thinking. It offers a synergistic union of the major themes of discrete mathematics together with the reasoning...
  • №107
  • 12,80 МБ
  • добавлен
  • изменен
Jones and Bartlett Publishers, 1992. - 352 Pages. This study in combinatorial group theory introduces the concept of automatic groups. It contains a succinct introduction to the theory of regular languages, a discussion of related topics in combinatorial group theory, and the connections between automatic groups and geometry which motivated the development of this new theory....
  • №108
  • 2,70 МБ
  • добавлен
  • изменен
L'Enseignement Mathematique. University de Geneve, 1980, -128 pp. In the present work we will discuss various problems in elementary number theory, most of which have a combinatorial flavor. In general, we will avoid classical problems, just mentioning references for the interested reader. We will almost never give proofs but on the other hand we will try to give as exact...
  • №109
  • 1,79 МБ
  • добавлен
  • изменен
CRC, 2009. - 280 pages. Pearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry, number theory, and combinatorics. Each chapter begins with a...
  • №110
  • 1,44 МБ
  • дата добавления неизвестна
  • изменен
Berlin: Springer-Verlag, 1981. — 498 р. Some time ago a group of mathematicians and computer scientists (including the editors of this volume) thought of making a scientific pilgrimage to the birthplace of al-Khwarizmi, the outstanding ninth-century mathematician who gave Ms name to the word "algorithm".As his name indicates, al-Khwarizmi came from the Khorezm oasis, a celebrated...
  • №111
  • 7,47 МБ
  • добавлен
  • изменен
Cambridge University Press, 2013. — 187 pages. — ISBN: 1107666945 This title forms part of the completely new Mathematics for the IB Diploma series. This highly illustrated book covers topic 10 of the IB Diploma Higher Level Mathematics syllabus, the optional topic Discrete Mathematics. It is also for use with the further mathematics course. Based on the new group 5 aims, the...
  • №112
  • 9,21 МБ
  • добавлен
  • изменен
Prentice Hall, 2003. — 216 p. — ISBN 0-13-018661-9. This book introduces readers to the mathematics of computer science and prepares them for the math they will encounter in other college courses. It includes applications that are specific to computer science, helps learners to develop reasoning skills, and provides the fundamental mathematics necessary for computer scientists....
  • №113
  • 8,91 МБ
  • дата добавления неизвестна
  • изменен
2009. — 312 p. Table of Contents Computers and Computing: Numbers, Circuits, and Logic Circuits Logic Design of a Simple Processor Cryptography: Integers and Modular Arithmetic Cryptography and Modular Arithmetic Integers and Division Combinatorics: Sets, Counting, and Probability Sets Counting Probability Algorithmic Analysis: Searching and Sorting Algorithms for Searching and...
  • №114
  • 5,09 МБ
  • добавлен
  • изменен
Cengage Learning, 2008. - 632 Pages. Discrete Mathematics combines a balance of theory and applications with mathematical rigor and an accessible writing style. The author uses a range of examples to teach core concepts, while corresponding exercises allow students to apply what they learn. Throughout the text, engaging anecdotes and topics of interest inform as well as...
  • №115
  • 9,20 МБ
  • дата добавления неизвестна
  • изменен
Издательство Springer, 1979, -251 pp. Since the early part of this century, logicians have been interested in decision procedures for theories in the predicate calculus. By a theory, we mean the set of sentences true about a particular structure, or the set of sentences true about every structure in a particular class of structures. One of the first decision procedures...
  • №116
  • 1,07 МБ
  • добавлен
  • изменен
Arkansas Tech University, 2016. — 344. This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in many disciplines such as computer science, engineering, Business, and the sciences. Besides reading the book, students are strongly encouraged to do all...
  • №117
  • 1,80 МБ
  • добавлен
  • изменен
Wiley-Interscience, 1994. — 360 p. — ISBN: 0471571806, 9780471571803 Introduces and clarifies the basic theories of 12 structural concepts, offering a fundamental theory of groups, rings and other algebraic structures. Identifies essentials and describes interrelationships between particular theories. Selected classical theorems and results relevant to current research are...
  • №118
  • 3,98 МБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Networking издательства NOWPress, 2007, -149 pp. Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first most natural questions one would ask about this new...
  • №119
  • 958,71 КБ
  • добавлен
  • изменен
Elsevier Science Ltd, 1986. — 410 p. — (Studies in Logic and the Foundations of Mathematics). — ISBN 0444878653, 9780444878656. Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by...
  • №120
  • 13,71 МБ
  • добавлен
  • изменен
Elsevier Science Ltd, 1986. — 410 p. — (Studies in Logic and the Foundations of Mathematics). — ISBN 0444878653, 9780444878656. Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by...
  • №121
  • 3,11 МБ
  • добавлен
  • изменен
Издательство Springer, 1998, -138 pp. During the university reform of the 1970s, the classical Faculty of Science of the venerable Ludwig-Maximilians-Universität in Munich was divided into five smaller faculties. One was for mathematics, the others for physics, chemistry and pharmaceutics, biology, and the earth sciences. Nevertheless, in order to maintain an exchange of ideas...
  • №122
  • 2,91 МБ
  • добавлен
  • изменен
Singapore: World Scientific, 2016. - 260 p. The present volume covers the general area of algebra, logic and combinatorics. The main readers are likely to be graduate students and more experienced researchers in the mathematical sciences, looking for introductions to areas with which they are unfamiliar. The mathematics presented is intended to be accessible to first year PhD...
  • №123
  • 1,47 МБ
  • добавлен
  • изменен
Springer Nature Singapore Pte Ltd., 2017. — 126 p. — ISBN 978-981-10-6146-2. Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan...
  • №124
  • 2,33 МБ
  • добавлен
  • изменен
Cambridge University Press, 1997. - 270 Pages. This book develops the combinatorics of Young tableaux and shows them in action in the algebra of symmetric functions, representations of the symmetric and general linear groups, and the geometry of flag varieties. The first part of the book is a self-contained presentation of the basic combinatorics of Young tableaux, including...
  • №125
  • 2,24 МБ
  • добавлен
  • изменен
Springer Science+Business Media, New York, 2013. — 206 p. — ISBN-10: 1461470978 It is a well-known fact that the concept of overconvergence in approximation theory may have several meanings. The most common, developed for the first time by Ostrovski and Walsh, is that given a sequence of functions approximating a given (analytic) function in a set (region), the convergence may...
  • №126
  • 1,34 МБ
  • добавлен
  • изменен
Springer, 2011. — 465 p. This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set...
  • №127
  • 4,03 МБ
  • дата добавления неизвестна
  • изменен
2nd edition in progress. — Springer, 2017. — 660 p. This is a book about discrete mathematics which also discusses mathematical reasoning and logic. Since the publication of the first edition of this book a few years ago, I came to realize that for a significant number of readers, it is their first exposure to the rules of mathematical reasoning and to logic. As a consequence, the...
  • №128
  • 7,22 МБ
  • добавлен
  • изменен
Basel: Birkhäuser, 2000. - 341p. This is the first book where mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep mathematical approaches. It contains a collection of refereed papers presented at the Colloquium on Mathematics and Computer Science held at the University of Versailles-St-Quentin on...
  • №129
  • 12,83 МБ
  • добавлен
  • изменен
Hoboken: Wiley, 2015. — 241 p. A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detecting global predicates in distributed systems, set...
  • №130
  • 1,73 МБ
  • добавлен
  • изменен
Издательство IOP Publishing, 2002, -766 pp. Discrete Mathematics for New Technology provides an accessible introduction to discrete mathematics. The approach is comprehensive but maintains an easy-to-follow progression from the basic mathematical ideas to more sophisticated concepts. Although the theory is presented rigorously, it is illustrated by the frequent use of pertinent...
  • №131
  • 3,60 МБ
  • добавлен
  • изменен
Second Edition. — Taylor & Francis, 2001. — 767 p. ISBN 0 7503 0652 1. Discrete Mathematics for New Technology provides an accessible introduction to discrete mathematics. The approach is comprehensive but maintains an easy-to-follow progression from the basic mathematical ideas to more sophisticated concepts. Although the theory is presented rigorously, it is illustrated...
  • №132
  • 4,42 МБ
  • добавлен
  • изменен
Hoboken: CRC Press, 2009. - 847p. Logic Propositions and Truth Values Logical Connectives and Truth Tables Tautologies and Contradictions Logical Equivalence and Logical Implication The Algebra of Propositions Arguments Formal Proof of the Validity of Arguments Predicate Logic Arguments in Predicate Logic Mathematical Proof The Nature of Proof Axioms and Axiom Systems Methods...
  • №133
  • 5,20 МБ
  • добавлен
  • изменен
3rd Edition. — CRC Press, 2009. — 843 p. — ISBN: 1439812802 Taking an approach to the subject that is suitable for a broad readership, Discrete Mathematics: Proofs, Structures, and Applications, Third Edition provides a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science. The approach is comprehensive yet...
  • №134
  • 5,22 МБ
  • добавлен
  • изменен
Издательство IOS Press, 2007, -348 pp. As a part of the NATO Security Through Science Programme, the goal of the Advanced Study Institute Physics and Computer Science was to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. No one can dispute the current importance of applied as well as theoretical Computer Science in...
  • №135
  • 5,86 МБ
  • добавлен
  • изменен
W.H. Freeman and Company, 2006. — 784 p. — ISBN: 071676864X. Computing Curricula 2001 (CC2001), a joint undertaking of the Institute for Electrical and Electronic Engineers/Computer Society (IEEE/CS) and the Association for Computing Machinery (ACM), identifies the essential material for an undergraduate degree in computer science. This Sixth Edition of Mathematical...
  • №136
  • 132,28 МБ
  • добавлен
  • изменен
7th edition. — W. H. Freeman and Company, 2014. — 784 p. — ISBN: 1429215100 Judith Gersting's Mathematical Structures for Computer Science has long been acclaimed for its clear presentation of essential concepts and its exceptional range of applications relevant to computer science majors. Now with this new edition, it is the first discrete mathematics textbook revised to meet...
  • №137
  • 21,81 МБ
  • добавлен
  • изменен
Springer, 2018. — 176 p. — (Springerbriefs in Computer Science). — ISBN 3030020738. Operads are algebraic devices offering a formalization of the concept of operations with several inputs and one output. Such operations can be naturally composed to form more complex ones. Coming historically from algebraic topology, operads intervene now as important objects in computer science...
  • №138
  • 4,76 МБ
  • добавлен
  • изменен
Springer, 2014. — 246 p. — (Springer Monographs in Mathematics). — ISBN 3319067427. In this new text, Steven Givant—the author of several acclaimed books, including works co-authored with Paul Halmos and Alfred Tarski—develops three theories of duality for Boolean algebras with operators. Givant addresses the two most recognized dualities (one algebraic and the other topological)...
  • №139
  • 2,53 МБ
  • добавлен
  • изменен
Издательство Springer, 2009, -588 pp. Серия Undergraduate Texts in Mathematics The theory of Boolean algebras was created in 1847 by the English mathematician George Boole. He conceived it as a calculus (or arithmetic) suitable for a mathematical analysis of logic. The form of his calculus was rather different from the modern version, which came into being during the period...
  • №140
  • 3,54 МБ
  • добавлен
  • изменен
13th Edition. — Boston, USA: Pearson, 2014. — 375 p. — (Instructor's Solutions Manual). — ISBN 0321867297. About the Author Larry Goldstein has received several distinguished teaching awards, given more than fifty Conference and Colloquium talks & addresses, and written more than fifty books in math and computer programming. He received his PhD at Princeton and his BA and MA at...
  • №141
  • 15,56 МБ
  • добавлен
  • изменен
New York: Chapman & Hall/CRC, 2007. — 1354 p. Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics. Starting with basic approaches, the handbook...
  • №142
  • 12,06 МБ
  • добавлен
  • изменен
Дискретная математика на английском языке. Состоит из 14 глав. Там есть большое количество заданий и к ним собственно ответы 0-Yes, There are Proofs! , 1-Logic, 2-Set and Relations, 3-functions, 4-The Integers, 5-Induction and Recursion, 6-Principles of Counting, 7-Permutations and Combinations, 8-Algorithms, 9-Graphs, 10-Path and Circuits, 11-Applications of Paths and Circuits,...
  • №143
  • 12,04 МБ
  • дата добавления неизвестна
  • изменен
2nd ed. Prentice Hall, 2001. - 538 pages. Adopting a user-friendly, conversational — and at times humorous — style, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader interest and bring clarity to even...
  • №144
  • 27,12 МБ
  • дата добавления неизвестна
  • изменен
2nd ed. — Prentice Hall, 2001. — 538 p. Adopting a user-friendly, conversational — and at times humorous — style, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader interest and bring clarity to even the...
  • №145
  • 5,63 МБ
  • добавлен
  • изменен
Springer, 2016. — 758 p. — ISBN-10: 3319255606. — ISBN-13: 978-3319255606 This text provides the first comprehensive treatment of the discrete fractional calculus. Experienced researchers will find the text useful as a reference for discrete fractional calculus and topics of current interest. Students who are interested in learning about discrete fractional calculus will find...
  • №146
  • 6,76 МБ
  • добавлен
  • изменен
Cambridge University Press, 2012. — 412 p. — ISBN: 9780521767248 Matroid theory is a vibrant area of research that provides a unified way to understand graph theory, linear algebra and combinatorics via finite geometry. This book provides the first comprehensive introduction to the field which will appeal to undergraduate students and to any mathematician interested in the...
  • №147
  • 7,43 МБ
  • добавлен
  • изменен
Prentice Hall, 2002. - 808 pages. For one-semester undergraduate Discrete Mathematics courses for math and computer science majors. This exceedingly well-written text equips students to apply discrete mathematics and provides opportunities for practice of the concepts presented. A semester of Calculus is useful for reasons of sophistication.
  • №148
  • 55,48 МБ
  • дата добавления неизвестна
  • изменен
Springer, 2010. - 377 pages. The field of discrete calculus, also known as discrete exterior calculus, focuses on finding a proper set of definitions and differential operators that make it possible to operate the machinery of multivariate calculus on a finite, discrete space. In contrast to traditional goals of finding an accurate discretization of conventional multivariate...
  • №149
  • 7,56 МБ
  • дата добавления неизвестна
  • изменен
Addison-Wesley Professional, 1994. - 672 pages. ISBN-10: 0201558025. ISBN-13: 978-0201558029. This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate...
  • №150
  • 11,25 МБ
  • дата добавления неизвестна
  • изменен
New York: Wiley, 1998. - 211p. Ramsey theory has emerged as a cohesive subdiscipline of combinatorial analysis since about 1970. The present work comprises a self-contained exposition of the central results of Ramsey theory, describes recent developments in the field, and explores the influence of outside disciplines such as applications of topological dynamics and a...
  • №151
  • 2,98 МБ
  • добавлен
  • изменен
Gries D., Schneider F.B. A Logical Approach to Discrete Math Издательство Dover Publications, 1993, -520 pp. 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 propositional and predicate calculi and then to...
  • №152
  • 3,44 МБ
  • добавлен
  • изменен
Addison-Wesley, 1994. - 1026 pages. Provides an introductory survey in both discrete & combinatorial mathematics. Intended for the beginning student designed to introduce a wide variety of applications & develop mathematical maturity of the student by studying an area that is so different form the traditional coverage in calculus & different equations.
  • №153
  • 15,28 МБ
  • дата добавления неизвестна
  • изменен
Palgrave Macmillan, 2002. - 320 Pages. Written with a clear and informal style "Discrete Mathematics for Computing" is aimed at first-year undergraduate computing students with very little mathematical background. It is a low-level introductory text which takes the topics at a gentle pace, covering all the essential material that forms the background for studies in computing...
  • №154
  • 2,78 МБ
  • добавлен
  • изменен
Издательство Springer, 2008, -535 pp. János Bolyai Mathematical Society. Laszlo Lovasz, briefly called Laci by his friends, turned sixty on March 9, 2008. To celebrate this special birthday two conferences have been held in Hungary, one in Budapest (August 5–9, 2008) with invited speakers only and one in Keszthely (August 11–15, 2008). Several top mathematicians and computer...
  • №155
  • 4,48 МБ
  • добавлен
  • изменен
Издательство Springer, 1988, -379 pp. Historically, there is a close connection between geometry and optimization. This is illustrated by methods Like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization, however, many of the strongest and most frequently used algorithms are based on the discrete structure...
  • №156
  • 4,04 МБ
  • добавлен
  • изменен
CRC Press, 2005. - 379 pages. ISBN: 0849331560 Advances in Discrete Mathematics and Applications Volume 4 Sharkovsky's Theorem, Li and Yorke's "period three implies chaos" result, and the (3x+1) conjecture are beautiful and deep results that demonstrate the rich periodic character of first-order, nonlinear difference equations. To date, however, we still know surprisingly...
  • №157
  • 4,45 МБ
  • добавлен
  • изменен
Chapman and Hall/CRC, 2011. – 921 p. – ISBN: 1420093649, 9781420093643 Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the...
  • №158
  • 22,93 МБ
  • добавлен
  • изменен
Springer, 2006. - 405 pages. Bolyai Society Mathematical Studies 15. Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers...
  • №159
  • 12,65 МБ
  • дата добавления неизвестна
  • изменен
Editors: Habib M., McDiarmid C., Ramirez-Alfonsin J., Reed B. Springer, 1998. - 172 р. The Probabilistic Method Probabilistic Analysis of Algorithms An Overview of Randomized Algorithms Mathematical Foundations of the Markov Chain Monte Carlo Method Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems Concentration Branching Processes...
  • №160
  • 4,11 МБ
  • добавлен
  • изменен
Издательство Kluwer, 2002, -568 pp. This book grew from courses taught at the University of Colorado (Boulder) and at the Universidad Politecnica de Madrid, Spain. As the title suggests, we were motivated by two disparate objectives. First, the VLSI CAD group at Boulder was given the responsibility for teaching a course which satisfied the ABET requirement for an upper division...
  • №161
  • 39,81 МБ
  • добавлен
  • изменен
Brooks Cole, 2005. — 718 Pages. Master the fundamentals of discrete mathematics with "Discrete Mathematics for Computer Science"! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a...
  • №162
  • 25,96 МБ
  • дата добавления неизвестна
  • изменен
Springer, 2000. — 344 p. — ISBN: 1852330899 This volume offers a new, "hands-on" approach to teaching Discrete Mathematics. A simple functional language is used to allow students to experiment with mathematical notations, which are traditionally difficult to pick up. This practical approach provides students with instant feedback and also allows lecturers to monitor progress...
  • №163
  • 18,40 МБ
  • добавлен
  • изменен
New York, USA: Dover Publications, Inc., 2018. — 156 p. — (first published in 1963). — (Dover Books on Mathematics). —– ISBN 9780486828046, 0486828042. Starting with Boolean rings and algebras, the treatment examines fields of sets, regular open sets, elementary relations, infinite operations, subalgebras, homomorphisms, free algebras, ideals and filters, and the homomorphism...
  • №164
  • 1002,14 КБ
  • добавлен
  • изменен
Dover Publications, 2018. — 122 p. — (Dover Books on Mathematics). — ASIN B07H6GQQ1N. This presentation on the basics of Boolean algebra has ranked among the fundamental books on this important subject in mathematics and computing science since its initial publication in 1963. Concise and informal as well as systematic, the text draws upon lectures delivered by Professor Halmos at...
  • №165
  • 4,10 МБ
  • добавлен
  • изменен
Dublin, Cambridge: 1853. — 736 p. Lectures on quaternions : containing a systematic statement of a new mathematical method, of which the principles were communicated in 1843 to the Royal Irish academy, and which has since formed the subject of successive courses of lectures, delivered in 1848 and subsequent years, in the halls of Trinity college, Dublin
  • №166
  • 41,86 МБ
  • добавлен
  • изменен
Amsterdam: Elsevier, 1997. — 661 p. There is a strong case for electrical network topologists and submodular function theorists being aware of each other's fields. Presenting a topological approach to electrical network theory, this book demonstrates the strong links that exist between submodular functions and electrical networks. The book contains: a detailed discussion of...
  • №167
  • 29,28 МБ
  • добавлен
  • изменен
American Mathematical Society, 2011, -380 pp. This book started as a collection of class notes on geometric approximation algorithms that was expanded to cover some additional topics. As the book title suggests, the target. audience of this book is people interested in geometric approximation algorithms. The book describes some key techniques in geometric approximation...
  • №168
  • 5,33 МБ
  • добавлен
  • изменен
Springer New York, 2010. - 400 pages. This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The second edition...
  • №169
  • 3,34 МБ
  • дата добавления неизвестна
  • изменен
Springer International Publishing AG, 2018. — 274 p. — (ICME-13 Monographs) — ISBN 978-3-319-70307-7. This book discusses examples of discrete mathematics in school curricula, including in the areas of graph theory, recursion and discrete dynamical systems, combinatorics, logic, game theory, and the mathematics of fairness. In addition, it describes current discrete mathematics...
  • №170
  • 5,00 МБ
  • добавлен
  • изменен
Basel: Birkhäuser, 2002. - 543p. The International Colloquium on Mathematics and Computer Science is a biennial event that first took place at the University of Versailles-St-Quentin in 2000 and was acknowledged a success. The second colloquium was held in September 16-19, 2002, again in Versailles; its proceedings are gathered in this book. The importance of these regular...
  • №171
  • 14,63 МБ
  • добавлен
  • изменен
2nd ed. — Jones & Bartlett Publishers, 2002. — 731 p. This introduction to discrete mathematics prepares future computer scientists, engineers, and mathematicians for success by providing extensive and concentrated coverage of logic, functions, algorithmic analysis, and algebraic structures. Discrete Mathematics, Second Edition illustrates the relationships between key concepts...
  • №172
  • 27,08 МБ
  • дата добавления неизвестна
  • изменен
Portland State University, 2005. — 160 p. This book contains programming experiments that are designed to reinforce the learning of discrete mathematics, logic, and computability. It is the outgrowth of the experimental portion of a one-year course in discrete structures, logic, and computability for sophomores at Portland State University. The course has evolved over the last...
  • №173
  • 496,74 КБ
  • добавлен
  • изменен
4th Edition. — Jones & Bartlett Learning, 2017. — 1023 p. — ISBN: 978-1-284-07040-8. Includes access to student companion website. Updated to align to the latest 2013 ACM/IEEE Computer Science curricula, This Book is designed for the one- to two-term Discrete Mathematics course. The structure of the book supports the spiral method of learning, by first introducing basic...
  • №174
  • 13,87 МБ
  • добавлен
  • изменен
World Scientific Publishing Co. Re. Ltd., 2005. — 310 p. — ISBN 9812565264. This volume includes papers by leading mathematicians in the fields of stochastic analysis, white noise theory and quantum information, together with their applications. The papers selected were presented at the International Conference on Stochastic Analysis: Classical and Quantum held at Meijo...
  • №175
  • 11,61 МБ
  • добавлен
  • изменен
World Scientific Publishing Co. Re. Ltd., 2005. — 310 p. — ISBN 9812565264. This volume includes papers by leading mathematicians in the fields of stochastic analysis, white noise theory and quantum information, together with their applications. The papers selected were presented at the International Conference on Stochastic Analysis: Classical and Quantum held at Meijo...
  • №176
  • 1,97 МБ
  • добавлен
  • изменен
Singapore: World Scientific, 2001. — 286 p. This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K.H. Kim, F.W. Roush and Susan Williams....
  • №177
  • 3,87 МБ
  • добавлен
  • изменен
Springer, 2016. – 167 p. – ISBN 978-3-319-39557-9. Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the...
  • №178
  • 2,17 МБ
  • добавлен
  • изменен
3rd edition. — Burlington: John&Barlett Learning, 2015. — 524 p. Written for the one-term course, Essentials of Discrete Mathematics, Third Edition is designed to serve computer science and mathematics majors, as well as students from a wide range of other disciplines. The mathematical material is organized around five types of thinking: logical, relational, recursive,...
  • №179
  • 17,85 МБ
  • добавлен
  • изменен
2nd edition. — New York: Springer, 2018. — 514 p. This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance...
  • №180
  • 7,73 МБ
  • добавлен
  • изменен
Springer, 2012. — 423 p. — ISBN: 1447140680, 9781447140696. This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the...
  • №181
  • 7,52 МБ
  • добавлен
  • изменен
Издательство Birkhäuser, 2003, -118 pp. These notes had their origin in a postgraduate lecture series I gave at the Eidgenössiche Technische Hochschule (ETH) in Zürich in the Spring of 2000. I am very grateful to my hosts, the Forschungsinstitut für Mathematik at ETH, for providing the ideal opportunity to develop and present this material in what I hope is a reasonably...
  • №182
  • 1,12 МБ
  • добавлен
  • изменен
Springer Basel, 2014. — 120 pages. ISBN: 3034805535 Galileo Galilei said he was reading the book of nature as he observed pendulums swinging, but he might also simply have tried to draw the numbers themselves as they fall into networks of permutations or form loops that synchronize at different speeds, or attach themselves to balls passing in and out of the hands of good...
  • №183
  • 10,32 МБ
  • добавлен
  • изменен
8th ed. — Pearson, 2017. — 768 p. — ISBN 0321964683. For one- or two-term introductory courses in discrete mathematics. An accessible introduction to the topics of discrete math, this best-selling text also works to expand students mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate...
  • №184
  • 23,04 МБ
  • добавлен
  • изменен
Pearson, 2007. — 789 p. For a one- or two-term introductory course in discrete mathematics. Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh’s algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user...
  • №185
  • 6,17 МБ
  • добавлен
  • изменен
Springer, 2016. — 255 p. — (Lecture Notes in Mathematics 2160). — ISBN 978-3-319-39779-5. This monograph deals with the mathematics of extending given partial data-sets obtained from experiments; Experimentalists frequently gather spectral data when the observed data is limited, e.g., by the precision of instruments; or by other limiting external factors. Here the limited...
  • №186
  • 3,60 МБ
  • добавлен
  • изменен
Издательство Springer, 2011, -633 pp. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this complexity Waterloo that have been discovered over the past several...
  • №187
  • 2,98 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1994, -315 pp. The origin of this book, whose first edition was published in 1968, is a series of notes by Paley and Zygmund that appeared in the 1930s, entitled 'On some series of functions' [167]. Paley and Zygmund, with the collaboration of Wiener in a subsequent paper, studied Fourier or Taylor series whose coefficients are...
  • №188
  • 4,24 МБ
  • добавлен
  • изменен
Издательство Springer, 2006, -413 pp. The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classification results....
  • №189
  • 1,99 МБ
  • добавлен
  • изменен
Издательство Springer, 2010, -366 pp. This book is the second volume of mathematical papers to commemorate the 60th birthday of Laszlo ('Laci') Lovasz on March 9, 2008. Prominent mathematicians that were inspired by Laci were invited to contribute to the celebrations of this milestone in the Summer of 2008. The response was overwhelming, and therefore two conferences were...
  • №190
  • 14,54 МБ
  • добавлен
  • изменен
AMS, 2018. — 224 p. — (Student Mathematical Library). — ISBN 9781470442903. This book takes the reader on a journey through Ramsey theory, from graph theory and combinatorics to set theory to logic and metamathematics. Written in an informal style with few requisites, it develops two basic principles of Ramsey theory: many combinatorial properties persist under partitions, but to...
  • №191
  • 2,64 МБ
  • добавлен
  • изменен
World Scientific Publishing Company, 2010. — 272 pages. In the past 50 years, discrete mathematics has developed as a far-reaching and popular language for modeling fundamental problems in computer science, biology, sociology, operations research, economics, engineering, etc. The same model may appear in different guises, or a variety of models may have enough similarities...
  • №192
  • 2,32 МБ
  • добавлен
  • изменен
Amsterdam: North Holland, 2015. - 438p. Latin Squares and Their Applications Second edition offers a long-awaited update and reissue of this seminal account of the subject. The revision retains foundational, original material from the frequently-cited 1974 volume but is completely updated throughout. As with the earlier version, the author hopes to take the reader ‘from the...
  • №193
  • 2,92 МБ
  • добавлен
  • изменен
USA.: Peter G. Doyle. 1998. - 190p. English. This work is freely redistributable under the terms of the GNU General Public License as published by the Free Software Foundation. This work comes with ABSOLUTELY NO WARRANTY. В связи с широким развитием "машинной математики" математиков всё больше начинают интересовать вопросы дискретной математики, т.е. математики, не...
  • №194
  • 1,03 МБ
  • добавлен
  • изменен
SIAM, 2011. - 389 pages. Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in such diverse...
  • №195
  • 4,67 МБ
  • добавлен
  • изменен
Springer, 2011. — 446 p. The last few decades have seen a stupendous growth in the speed and complexity of VLSI integrated circuits. This growth has been enabled by a powerful set of electronic design automation (EDA) tools. The earliest EDA tools were two-level logic minimization and PLA folding tools. Subsequently, EDA tools were developed to address other aspects of the VLSI...
  • №196
  • 4,38 МБ
  • добавлен
  • изменен
Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory . Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics . Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory . Divisibility of Numbers. Important...
  • №197
  • 1,31 МБ
  • добавлен
  • изменен
Издательство Springer, 2006, -618 pp. Dedicated to Jarik Nešetřil on the Occasion of his 60th Birthday. The purpose of this book is twofold. We would like to offer our readers a collection of high quality papers in selected topics of Discrete Mathematics, and, at the same time, celebrate the 60th anniversary of Jarik Nešetřil. Since our discipline has experienced the explosive...
  • №198
  • 5,19 МБ
  • добавлен
  • изменен
Prentice Hall, 1996. - 524 pages. Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed. The book uses algorithms and pseudocode to...
  • №199
  • 5,14 МБ
  • дата добавления неизвестна
  • изменен
Springer, 1974. — 389 p. The digital computer is a machine which is inherently finite in all of its aspects which are of importance to a programmer or user. Whether the problem posed to the computer relates to numerical computation, symbol manipulation, information retrieval, or picture generation, the procedures and results are restricted by the finiteness of word length and...
  • №200
  • 8,01 МБ
  • добавлен
  • изменен
Bonn: Bernhard Korte, 2016. — 45 p. Introduction Fundamental Counting Rules Elementary Counting Coefficients Assignments Generalized Counting Coefficients Permutations Further Combinatorial Techniques Computation of Sums Sums: Direct Methods Difference and Sum Operators Inversions Linear Recursions of Depth Generating Functions Using Generating Functions to Solve Recursions...
  • №201
  • 332,71 КБ
  • добавлен
  • изменен
Academic Press, 2003. - 1045 pages. This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science...
  • №202
  • 37,30 МБ
  • дата добавления неизвестна
  • изменен
Издательство Cambridge University Press, 1995, -356 pp. The central problem of complexity theory is the relation of deterministic and nondeterministic computations: whether Ρ equals NP, and generally whether the polynomial time hierarchy PH collapses. The famous Ρ versus NP problem is often regarded as one of the most important and beautiful open problems in contemporary...
  • №203
  • 2,00 МБ
  • добавлен
  • изменен
McGraw-Hill, 2008. - 364 pages. If you're interested in learning the fundamentals of discrete mathematics but can't seem to get your brain to function, then here's your solution. Add this easy-to-follow guide to the equation and calculate how quickly you learn the essential concepts. Written by award-winning math professor Steven Krantz, Discrete Mathematics Demystified...
  • №204
  • 4,51 МБ
  • дата добавления неизвестна
  • изменен
Boston; Basel; Stuttgart: Birkhäuser, 1986. – 413 p. ISBN 978-0-8176-3173-4; ISBN 978-1-4684-9199-9 (eBook); DOI 10.1007/978-1-4684-9199-9 This volume makes accessible some of the best results in matroid theory. Each paper is followed by a commentary providing background and a bibliography of related work. The volume is divided into five sections: origins and basic concepts;...
  • №205
  • 5,24 МБ
  • добавлен
  • изменен
Springer, 2018. — 491 p. — (Texts in Computer Science). — ISBN 3319926446. This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well...
  • №206
  • 6,57 МБ
  • добавлен
  • изменен
Geneseo: SUNY, 2015. — 299 p. This is a text that covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed...
  • №207
  • 1,35 МБ
  • добавлен
  • изменен
Издательство Kluwer, 1994, -297 pp. Timing research in high performance VLSI systems has advanced at a steady pace over the last few years, while tools, especially theoretical mechanisms, lag behind. Much present timing research relies heavily on timing diagrams, which, although intuitive, are inadequate for analysis of large designs with many parameters. Further, timing...
  • №208
  • 3,64 МБ
  • добавлен
  • изменен
AK Peters, 2007. - 240 Pages. ISBN: 1568813236 (CMS Treatises in Mathematics) Every mathematician, and user of mathematics, needs to manipulate sums or to find and handle combinatorial identities. In this book, the author provides a coherent tour of many known finite algebraic sums and offers a guide for devising simple ways of changing a given sum to a standard form that can...
  • №209
  • 904,99 КБ
  • добавлен
  • изменен
Springer International Publishing AG, 2017. — 59 p. — (SpringerBriefs in Computer Science) — ISBN 3319571826. This book is a pedagogical presentation aimed at advanced undergraduate students, beginning graduate students and professionals who are looking for an introductory text to the field of Distance Geometry, and some of its applications. This versions profits from feedback...
  • №210
  • 1,42 МБ
  • добавлен
  • изменен
Издательство John Wiley, 1998, -163 pp. This book is designed as a textbook. Its aim is to introduce various areas and applications in discrete mathematics via the use of Latin squares. Latin squares have been studied for centuries. They have a very fascinating history and, more important, many practical applications in areas of science, engineering, and statistics as well as...
  • №211
  • 2,47 МБ
  • добавлен
  • изменен
Revised Edition. — MIT, 2012. — 829 p. This text explains how to use mathematical models and methods to analyze problems that arise in computer science. The subject offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering, adnd covers: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, relations; Discrete...
  • №212
  • 8,14 МБ
  • добавлен
  • изменен
Boston: The MIT Press, 2017. — 987 p. Proofs Introduction References What is a Proof? Propositions Predicates The Axiomatic Method Our Axioms Proving an Implication Proving an “If and Only If” Proof by Cases Proof by Contradiction Good Proofs in Practice References The Well Ordering Principle Well Ordering Proofs Template for Well Ordering Proofs Factoring into Primes Well Ordered...
  • №213
  • 12,83 МБ
  • добавлен
  • изменен
Princeton University Computer Science Department, 2004. — 339 pages. This book offers an introduction to Mathematics oriented toward Computer Science and Engineering. The goal is to make students mathematically literate in preparation for studying a scientific/engineering discipline Fundamental concepts of mathematics: definitions, proofs, sets, functions, relations....
  • №214
  • 5,52 МБ
  • добавлен
  • изменен
M.I.T., 2017. — 999 p. This book covers elementary discrete mathematics for Computer Science and Engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Proofs. Introduction. What is a Proof ? The Well Ordering Principle. Logical Formulas. Mathematical Data Types. Induction. State Machines. Recursive Data Types. Infinite Sets. Structures....
  • №215
  • 6,42 МБ
  • добавлен
  • изменен
2nd Ed. — CreateSpace Independent Publishing Platform, 2016. — 335 p. — ISBN: 1534970746, 9781534970748 This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves...
  • №216
  • 1,44 МБ
  • добавлен
  • изменен
3rd ed. — Independently published, 2019. — 407 p. — ISBN 978-1792901690. This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in...
  • №217
  • 5,49 МБ
  • добавлен
  • изменен
Princeton University Press, 2019. — 402 p. — ISBN 978-0-691-17929-2. A more intuitive approach to the mathematical foundation of computer science Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn....
  • №218
  • 24,62 МБ
  • добавлен
  • изменен
Princeton University Press, 2019. — 402 p. — ISBN 978-0-691-17929-2. A more intuitive approach to the mathematical foundation of computer science Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn....
  • №219
  • 3,45 МБ
  • добавлен
  • изменен
Hoboken: Wiley, 2017. — 680 p. Written exclusively with computer science students in mind, Discrete Mathematics for Computer Science provides a comprehensive treatment of standard course topics for the introductory discrete mathematics course with a strong emphasis on the relationship between the concepts and their application to computer science. The book has been crafted to...
  • №220
  • 19,35 МБ
  • добавлен
  • изменен
World Scientific Publishing Company, 1995. - 450 Pages. This text provides a guide to dealing with 3-manifolds by computers. Its emphasis is on presenting algorithms which are used for solving (in practice) the homeomorphism problem for the smallest of these objects. The key concept is the 3-gem, a special kind of edge-colored graph, which encodes the manifold via a ball...
  • №221
  • 4,72 МБ
  • дата добавления неизвестна
  • изменен
2nd Edition. — The McGraw-Hill Companies, Inc., 1987. — 369 p. — (Schaum's Outline Series). — ISBN 0-07-037990-4. Computers appear in almost all fields of human endeavor, wherever data are collected and analyzed. Furthermore, with the development of inexpensive microcomputers, more and more individuals are buying and operating their own computer. For these reasons, certain...
  • №222
  • 21,63 МБ
  • добавлен
  • изменен
McGraw-Hill, 1996. - 339 pages. The first edition of this popular text and reference has been translated into five languages! Students and practitioners will understand why when they use this powerful study tool and see how it makes learning and doing finite mathematics so much easier. They'll also appreciate, in this edition, the all new sections on graph theory, descriptive...
  • №223
  • 22,14 МБ
  • дата добавления неизвестна
  • изменен
McGraw-Hill Companies, 2009. — 489 pages. Schaum’s Outline Series Third Edition ISBN: 0071615865 Confusing Textbooks? Missed Lectures? Not Enough Time? Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every...
  • №224
  • 4,03 МБ
  • дата добавления неизвестна
  • изменен
McGraw-Hill, 2007. - 489 pages. 3rd edition. Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You...
  • №225
  • 11,26 МБ
  • добавлен
  • изменен
McGraw-Hill, 1997. - 528 pages. The first edition of this book sold more than 100,000 copies - and this new edition will show you why! Schaum's Outline of Discrete Mathematics shows you step by step how to solve the kind of problems you're going to find on your exams. And this new edition features all the latest applications of discrete mathematics to computer science! This...
  • №226
  • 6,32 МБ
  • дата добавления неизвестна
  • изменен
McGraw-Hill, 2005. - 349 pages. ISBN: 0071388974 This real-world, application-oriented outline introduces non-math majors to: linear equations and linear growth; exponential functions and geometric growth; sets; and counting. Following this material are applications using the formulas derived in topics such as: descriptive statistics; basic probability theory; graphs and...
  • №227
  • 5,11 МБ
  • добавлен
  • изменен
3nd Edition. — McGraw-Hill Companies, 2007. — 490 p. — ISBN: 0-07-151101-6. Tough Test Questions? Missed Lectures? Not Enough Time? Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents...
  • №228
  • 4,13 МБ
  • добавлен
  • изменен
3nd Edition. — McGraw-Hill Companies, 2007. — 490 p. — ISBN: 0-07-151101-6. Tough Test Questions? Missed Lectures? Not Enough Time? Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents...
  • №229
  • 6,05 МБ
  • добавлен
  • изменен
Mcgraw-Hill College, 1985. — 448 p. — 2nd Sub edition — (Mcgraw Hill Computer Science Series). — ISBN: 007038133X, 9780070381339 The second edition retains almost all the material in the first edition and includes three new chapters, namely, Chapter 2: Computability and Formal Languages, Chapter 7: Finite State Machines, and Chapter 8: Analysis of Algorithms, as well as several...
  • №230
  • 5,11 МБ
  • добавлен
  • изменен
Society for Industrial Mathematics, 2000. 84 p. ISBN-10:0898714362 Here is an in-depth, up-to-date analysis of wave interactions for general systems of hyperbolic and viscous conservation laws. This self-contained study of shock waves explains the new wave phenomena from both a physical and a mathematical standpoint. The analysis is useful for the study of various physical...
  • №231
  • 3,24 МБ
  • добавлен
  • изменен
Kapa & Omega, Glendale, AZ, USA, 2010. - 503 p. Abstract: A Smarandache system (G;R) is such a mathematical system with at least one Smarandachely denied rule r in R such that it behaves in at least two different ways within the same set G, i.e. , validated and invalided, or only invalided but in multiple distinct ways. A map is a 2-cell decomposition of surface, which can be...
  • №232
  • 2,28 МБ
  • дата добавления неизвестна
  • изменен
Glendale: Kapa & Omega, 2010. — 501 p. Maps as a mathematical topic arose probably from the four color problem and the more general map coloring problem in the mid of nineteenth century although maps as polyhedra which go back to the Platonic age. I could not list references in detail on them because it is well known for a large range of readers and beyond the scope of this...
  • №233
  • 2,13 МБ
  • добавлен
  • изменен
Издательство Vieweg+Teubner, 2010, -186 pp. The purpose of these lecture notes is to briefly describe some of the basic concepts interlacing discrete mathematics, statistical physics and knot theory. I tried to emphasize a ’combinatorial common sense’ as the main method. No attempt of completeness was made. The book should be accessible to the students of both mathematics and...
  • №234
  • 1,45 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2002, -515 pp. Combinatorics on words is a field that has grown separately within several branches of mathematics, such as number theory, group theory or probability theory, and appears frequently in problems of theoretical computer science, as dealing with automata and formal languages. A unified treatment of the theory appeared in...
  • №235
  • 4,52 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2004, -576 pp. A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers...
  • №236
  • 3,73 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1997, -254 pp. This is the first book devoted to broad study of the combinatorics of words, that is to say, of sequences of symbols called letters. This subject is in fact very ancient and has cropped up repeatedly in a wide variety of contexts. Even in the most elegant parts of abstract pure mathematics, the proof of a beautiful theorem...
  • №237
  • 3,15 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1997, -254 pp. This is the first book devoted to broad study of the combinatorics of words, that is to say, of sequences of symbols called letters. This subject is in fact very ancient and has cropped up repeatedly in a wide variety of contexts. Even in the most elegant parts of abstract pure mathematics, the proof of a beautiful theorem...
  • №238
  • 1,54 МБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 1986, -96 pp. There is little doubt that the present explosion of interest in the algorithmic aspects of mathematics is due to the development of computers — even though special algorithms and their study can be traced back all the way through the history of mathematics. Mathematics started out in Egypt and Babylon as a clearly...
  • №239
  • 824,05 КБ
  • добавлен
  • изменен
Springer, 2003. - 296 pages. From the reviews: "The goal of this book is to use the introduction to discrete mathematics … . Consequently, the authors … take a lot of time to explain proof techniques and to motivate definitions and style. The language is very informal and easy to read. The level is always introductory which makes it possible to give a taste of a wide range of...
  • №240
  • 2,73 МБ
  • дата добавления неизвестна
  • изменен
Chapman & Hall/CRC, 2011. - 221 pages. To truly understand how the Internet and Web are organized and function requires knowledge of mathematics and computation theory. Mathematical and Algorithmic Foundations of the Internet introduces the concepts and methods upon which computer networks rely and explores their applications to the Internet and Web. The book offers a unique...
  • №241
  • 1,68 МБ
  • дата добавления неизвестна
  • изменен
Издательство Springer, 2005, -246 pp. Proceedings of the Third International Symposium, SAGA 2005 This volume constitutes the proceedings of the 3rd Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2005), held in Moscow, Russia, at Moscow State University on October 20–22, 2005. The symposium was organized by the Department of Discrete Mathematics,...
  • №242
  • 4,03 МБ
  • добавлен
  • изменен
MIT OpenCourse, 2008. — 91 p. An antidote to mathematical rigor mortis, teaching how to guess answers without needing a proof or an exact calculation. In problem solving, as in street fighting, rules are for fools: do whatever works—don't just stand there! Yet we often fear an unjustified leap even though it may land us on a correct result. Traditional mathematics teaching is...
  • №243
  • 1,09 МБ
  • добавлен
  • изменен
2nd Edition — Springer, 2012. — 304 p. — ISBN: 1447124995, 9781447124993 This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with...
  • №244
  • 2,09 МБ
  • добавлен
  • изменен
Course Technology Inc, 2004. - 906 pages. Discrete Mathematical Structures teaches students the mathematical foundations of computer science, including logic, Boolean algebra, basic graph theory, finite state machines, grammars, and algorithms. This required class for Computer Science students helps them understand mathematical reasoning for reading, comprehension, and...
  • №245
  • 13,20 МБ
  • дата добавления неизвестна
  • изменен
New York: Springer, 2016. - 674 p. This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a...
  • №246
  • 8,79 МБ
  • добавлен
  • изменен
Johannes Kepler University, Linz, 2010. — 145 p. The objective of the course is to provide an overview of the main topics and techniques of Discrete Mathematics. The emphasis will be on the investigation of the most fundamental combinatorial structures. Words and Sets Graphs and Digraphs Eulerian and Hamiltonian graphs Introduction to Clones Minimal clones and CSP
  • №247
  • 679,88 КБ
  • добавлен
  • изменен
Johannes Kepler University, Linz, 2006. — 164 p. The objective of the course is to provide an overview of the main topics and techniques of Discrete Mathematics. The emphasis will be on the investigation of the most fundamental combinatorial structures. In this course we address some of the most importand topics in Discrete Mathematics: elementary combinatorial configurations...
  • №248
  • 1,01 МБ
  • добавлен
  • изменен
Издательство Springer, 2010, -299 pp. Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the most uniform way of distributing n points in the unit square? How big is the irregularity necessarily present in any such distribution? For a precise formulation of these questions, we must quantify the irregularity...
  • №249
  • 4,37 МБ
  • добавлен
  • изменен
Oxford University Press, 1998. — 426 pages. Invitation to Discrete Mathematics is at once an introduction and a thoroughly comprehensive textbook for courses in combinatorics and graph theory. It also contains introductory chapters for more specialized courses such as probabilistic methods, applied linear algebra, combinatorial enumeration, and operations research. A lively and...
  • №250
  • 19,68 МБ
  • дата добавления неизвестна
  • изменен
Издательство Oxford University Press, 2008, -461 pp., Second Edition, Misprints corrected, Contents added This is the second edition of Invitation to Discrete Mathematics. Compared to the first edition we have added Chapter 2 on partially ordered sets, Section 4.7 on Turan’s theorem, several proofs of the Cauchy–Schwarz inequality in Section 7.3, a new proof of Cayley’s...
  • №251
  • 3,54 МБ
  • добавлен
  • изменен
John Wiley & Sons, 1993. - 538 pages. Applauded by reviewers for its inviting, conversational style and outstanding coverage of logic and inductions, it introduces students to the topics and language of discrete mathematics and prepares them for future work in mathematics and/or computer science. Mattson develops students' mathematical thinking and overall maturity through...
  • №252
  • 5,72 МБ
  • дата добавления неизвестна
  • изменен
Third Edition. — A K Peters, 2005. — 803 p. — ISBN: 1568811667 Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a...
  • №253
  • 2,42 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1990, -443 pp. The development of VLSI fabrication technology has resulted in a wide range of new ideas for application specific hardware and computer architectures, and in an extensive set of significant new theoretical problems for the design of hardware. The design of hardware is a process of creating a device that realises an...
  • №254
  • 3,02 МБ
  • добавлен
  • изменен
Cambridge University Press, 1996. — 125 p. This book is the first systematic and rigorous account of continuum percolation. The authors treat two models, the Boolean model and the random connection model, in detail, and discuss a number of related continuum models. Where appropriate, they make clear the connections between discrete percolation and continuum percolation. All...
  • №255
  • 1,89 МБ
  • добавлен
  • изменен
Springer, 1989. — 138 p. One of the fundamental issues of complexity theory is to estimate the relative efficiency of different models of computation. A general program in doing this has been to take abstract models of computation, such as Turing machines, Random Access Machines, Boolean circuits or branching programs, and examine their behavior under certain resource...
  • №256
  • 694,94 КБ
  • добавлен
  • изменен
Springer, 1989. — 138 p. One of the fundamental issues of complexity theory is to estimate the relative efficiency of different models of computation. A general program in doing this has been to take abstract models of computation, such as Turing machines, Random Access Machines, Boolean circuits or branching programs, and examine their behavior under certain resource...
  • №257
  • 1,31 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2017. — 299 p. — (Contemporary Systems Thinking) — ISBN: 3319548034. This study adopts the logic of Systems Thinking and Control Systems, presenting a simple but complete theory called the Theory of Combinatory Systems. This new theory is able to describe, interpret, explain, simulate and control collective phenomena and their observable...
  • №258
  • 9,55 МБ
  • добавлен
  • изменен
N.-Y.: Springer, 2015. - 129p. This monograph has two main objectives. The first one is to give a self-contained exposition of the relevant facts about set operads, in the context of combinatorial species and its operations. This approach has various advantages: one of them is that the definition of combinatorial operations on species, product, sum, substitution and derivative,...
  • №259
  • 5,64 МБ
  • добавлен
  • изменен
Издательство Johns Hopkins University Press, 2009, -272 pp. The adventures in this book are launched by easily understood questions from the realm of discrete mathematics, a wide-ranging subject that studies fundamental properties of the counting numbers 1, 2, 3, . and arrangements of finite sets. The book grew from talks for mathematically inclined secondary school students...
  • №260
  • 1,12 МБ
  • добавлен
  • изменен
Издательство Springer, 1980, -176 pp. These notes present a calculus of concurrent systems. The presentation is partly informal, and aimed at practice; we unfold the calculus through the medium of examples each of which illustrates first its expressive power, and second the techniques which it offers for verifying properties of a system. A useful calculus, of computing...
  • №261
  • 2,06 МБ
  • добавлен
  • изменен
Kluwer, 1996. — 151 p. Symbolic Boolean manipulation using Binary Decision Diagrams (BDDs) has been applied successfully to a wide variety of tasks, particularly in very large scale integration (VLSI) computer-aided design (CAD). The concept of decision graphs as an abstract representation of Boolean functions dates back to early work by Lee and Akers. In the last ten years,...
  • №262
  • 1,80 МБ
  • добавлен
  • изменен
L.: Springer, 2013.- 500p. This engaging text presents the fundamental mathematics and modelling techniques for computing systems in a novel and light-hearted way, which can be easily followed by students at the very beginning of their university education. Key concepts are taught through a large collection of challenging yet fun mathematical games and logical puzzles that...
  • №263
  • 15,28 МБ
  • добавлен
  • изменен
Long Grove: Waveland Press, Inc., 1997. — 525 p. — ISBN 978-0881339406. This highly regarded work fills the need for a treatment of elementary discrete mathematics that provides a core of mathematical terminology and concepts as well as emphasizes computer applications. Includes numerous elementary applications to computing and examples with solutions. Contents Number Systems The...
  • №264
  • 81,66 МБ
  • добавлен
  • изменен
Canadian Mathematical Monographs, 1970, -121 pp. My object has been to gather together various combinatorial results on labelled trees. The basic definitions are given in the first chapter; enumerative results are presented in the next five chapters, classified according to the type of argument involved; some probabilistic problems on random trees are treated in the last...
  • №265
  • 678,04 КБ
  • добавлен
  • изменен
2nd edition. — Prentice Hall of India, 1985. — 768 p. — ISBN: 8120315022 This is a lucidly written fine-tuned introduction to discrete mathematics. It is eminently suited for students persuing BCA, MCA and B.E./B.Tech courses. Considering the importance of the subject, quite a number of universities have sought to introduce discrete mathematics as a core subject in the...
  • №266
  • 6,38 МБ
  • добавлен
  • изменен
Springer Science+Business Media, New York, 2013. — 427 p. — ISBN: 1461451272. This volume is a collection of research surveys on the Distance Geometry Problem (DGP) and its applications. It will be divided into three parts: Theory, Methods and Applications. Each part will contain at least one survey and several research papers. The first part, Theory, will deal with theoretical...
  • №267
  • 5,63 МБ
  • добавлен
  • изменен
Издательство Springer, 2006, -447 pp. This book has two goals. On the one hand it develops a completely new unifying theory of self-dual codes that enables us to prove a far-reaching generalization of Gleason’s theorem on weight enumerators of self-dual codes. On the other hand it is an encyclopedia that gives a very extensive list of Types of self-dual codes and their...
  • №268
  • 3,11 МБ
  • добавлен
  • изменен
Издательство Kluwer, 2003, -133 pp. This proceedings is for the most part, a collection of papers presented in the three-day onference, held in Los Angeles, May 30 - June 1,2002, celebrating the 70th bIrthday of Professor Solomon W. Golomb. All contributions to the proceedings were peer-reviewed. Reflecting the interests of Professor Golomb, the major topics include sequences...
  • №269
  • 6,03 МБ
  • добавлен
  • изменен
Издательство MRSI, 1996, -482 pp. Combinatorial Game Theory, as an academic discipline, is still in its infancy. Many analyses of individual games have appeared in print, starting in 1902 with C.L. Bouton's analysis of the game of Nim. (For exact references to the works mentioned here, please see A. Fraenkel's bibliography on page 493 . It is was not until the 1930's that a...
  • №270
  • 6,32 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2002, -547 pp. This book is a state-of-the-art look at combinatorial games, that is, games not involving chance or hidden information. It contains articles by some of the foremost researchers and pioneers of combinatorial game theory, such as Elwyn Berlekamp and John Conway, by other researchers in mathematics and computer science, and...
  • №271
  • 4,68 МБ
  • добавлен
  • изменен
Издательство Springer, 2006, -445 pp. Computer science abounds with applications of discrete mathematics, yet students of computer science often study discrete mathematics in the context of purely mathematical applications. They have to figure out for themselves how to apply the ideas of discrete mathematics to computing problems. It is not easy. Most students fail to...
  • №272
  • 1,97 МБ
  • добавлен
  • изменен
Cambridge University Press, 2014. — 444 p. — ISBN: 1107038324, 9781107038325 Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their...
  • №273
  • 2,93 МБ
  • добавлен
  • изменен
N. Y. ; L. : Academic Press, 1967.— xvi, 260 p. Puzzling problems permeate mathematics, and this is probably the strongest reason for the burgeoning growth of this queen of the sciences. The object of this book is to discuss the methods in graph theory that have been developed in the last century for attacking the four-color problem. It may be said without exaggeration...
  • №274
  • 8,97 МБ
  • добавлен
  • изменен
Springer, 2016. — 368 p. — (Texts in Computer Science). — ISBN: 331944560X, 9783319445601 This stimulating textbook presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this...
  • №275
  • 6,98 МБ
  • добавлен
  • изменен
New York: Springer, 2016. — 378 p. This stimulating textbook presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this important skill. Features: provides an introduction to the...
  • №276
  • 7,63 МБ
  • добавлен
  • изменен
Springer, 2013. — 304 p. — ISBN: 144714533X, 1447145356 From the earliest examples of computation to the digital devices that are ubiquitous in modern society, the application of mathematics to computing has underpinned the technology that has built our world. This clearly written and enlightening textbook/reference provides a concise, introductory guide to the key mathematical...
  • №277
  • 3,73 МБ
  • добавлен
  • изменен
Springer, 2019. — 235 p. 9th International Conference on Non-Integer Order Calculus and Its Applications, Łódź, Poland. This book focuses on fractional calculus, presenting novel advances in both the theory and applications of non-integer order systems. At the end of the twentieth century it was predicted that it would be the calculus of the twenty-first century, and that prophecy...
  • №278
  • 16,89 МБ
  • добавлен
  • изменен
Издательство InTech, 2011, -352 pp. Invented by Marco Dorigo in 1992, Ant Colony Optimization (ACO) is a meta-heuristic stochastic combinatorial computational discipline inspired by the behavior of ant colonies which belong to a family of meta-heuristic stochastic methodologies such as simulated annealing, Tabu search and genetic algorithms. It is an iterative method in which...
  • №279
  • 4,87 МБ
  • добавлен
  • изменен
Oxford University Press, 1992. — 542 p. Matroid theory examines and answers questions like these. Seventy-five years of study of matroids has seen the development of a rich theory with links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical and...
  • №280
  • 7,33 МБ
  • добавлен
  • изменен
Springer – 2012, 300 pages ISBN: 3642298397, 9783642298400 Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design - its...
  • №281
  • 3,54 МБ
  • добавлен
  • изменен
Издательство Addison-Wesley, 1994, -540 pp. This book is an introduction to the theory of computational complexity at a level appropriate for a beginning graduate or advanced undergraduate course. Computational complexity is the area of computer science that contemplates the reasons why some problems are so hard to solve by computers. This field, virtually non-existent only 20...
  • №282
  • 4,50 МБ
  • добавлен
  • изменен
Springer, 2013. — 57 p. This monograph discusses some of the most well-known string selection problems (SSP), offering a compendium of the current state-of-the-art methods presented in the literature. In particular, this work is intended as a general and comprehensive guide to understanding the very basic notions of mathematical optimization for sequence selection in biology, and...
  • №283
  • 408,38 КБ
  • добавлен
  • изменен
Cornell University, 2011, -153 pp. Discrete mathematics deals with objects that come in discrete bundles, e.g., 1 or 2 babies. In contrast, continuous mathematics deals with objects that vary continuously, e.g., 3.42 inches from a wall. Think of digital watches versus analog watches (ones where the second hand loops around continuously without stopping). Why study discrete...
  • №284
  • 691,28 КБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1992, -211 pp. Complexity theory attempts to understand and measure the intrinsic difficulty of computational tasks. The study of Boolean Function Complexity reaches for the combinatorial origins of these difficulties. The field was pioneered in the 1950's by Shannon, Lupanov and others, and has developed now into one of the most...
  • №285
  • 1,16 МБ
  • добавлен
  • изменен
Издательство World Scientific, 2004, -1317 pp. This book continues the tradition of two previous books Current Trends in Theoretical Computer Science, published by World Scientific Publishing Company in 1993 and 2001. We have been very impressed and encouraged by the exceptionally good reception of the two previous books. The positive comments received show that books of this...
  • №286
  • 57,38 МБ
  • добавлен
  • изменен
Chapman & Hall/CRC, 2006. — 243 p. This book contains original contributions of the author in the field of authentication schemes. Most of which are already published by international conferences and in journals, but they are presented with improvement in this book together with references and reviews of related work by other authors in the field. Gus Simmons first introduced the...
  • №287
  • 1,52 МБ
  • добавлен
  • изменен
Cambridge University Press, UK, 2013. — 396 p. — (Cambridge Studies in Advanced Mathematics 140) — ISBN: 1107031575 This book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective. Analytic combinatorics is a branch of enumeration that uses analytic techniques to estimate combinatorial quantities: generating functions are...
  • №288
  • 3,20 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2003, -497 pp. Combinatorica has been perhaps the most widely used software for teaching and research in discrete mathematics since its initial release in 1990. Combinatorica is an extension to Mathematica, which has been used by researchers in mathematics, physics, computer science, economics, and anthropology. Combinatorica received a...
  • №289
  • 12,45 МБ
  • добавлен
  • изменен
Springer, 2014. — 154 p. — (Universitext). — ISBN: 3319079646. The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates. The book takes a number of specific problems and solves them, the needed tools developed along the way in the context of...
  • №290
  • 1,95 МБ
  • добавлен
  • изменен
New York: Springer, 2014. - 127p. Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial...
  • №291
  • 2,28 МБ
  • добавлен
  • изменен
Trent University, 2006, -181 pp. The word `democracy’ has been used to describe many different political systems, which often yield wildly different outcomes. The simple rule of `decision by majority’ can be made complicated in several ways: Granting veto power to some participants (e.g. the permanent members of the UN Security Council or the President of the United States),...
  • №292
  • 1,25 МБ
  • добавлен
  • изменен
New York: Springer. – 2003. – 239 p. Recent history saw an unprecedented rise in amateur juggling. Today, there are hundreds of juggling clubs around the world, there are a number of specialized juggling magazines, and every year thousands of jugglers gather at juggling conventions to practice, exchange ideas, take part in competitions, and have fun together. Juggling is...
  • №293
  • 2,62 МБ
  • добавлен
  • изменен
2nd. ed. - Springer, 2019. - 508 p. The expanded and updated 2nd. edition of this classic text offers the reader a comprehensive introduction to the concepts of logic functions and equations and their applications across computer science. The approach emphasizes a thorough understanding of the fundamental principles as well as numerical and computer-based solution methods. Updated...
  • №294
  • 11,59 МБ
  • добавлен
  • изменен
New Age International (P) Ltd., 2009. – 459 p. – 2nd ed. – ISBN: 8122426697, 9788122426694 This edition is a revision of 2002 edition of the book. Considerable attention has been given to improve the first edition. As far as possible efforts were made to keep the book free from typographic and other errors. Most of the changes were made at the suggestions of the individuals who...
  • №295
  • 5,13 МБ
  • добавлен
  • изменен
N.-Y.: Springer, 2015. — 173 p. Contains open problems and new ideas for research Develops a geometric theory in an extended context Uses the lattice structure for all representations of boolean representations of simplicial complexes This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of...
  • №296
  • 2,31 МБ
  • добавлен
  • изменен
Brooks Cole, 2010. — 920 pages. Get the background you need for future courses and discover the usefulness of mathematical concepts in analyzing and solving problems with FINITE MATHEMATICS, 7th Edition. The author clearly explains concepts, and the computations demonstrate enough detail to allow you to follow-and learn-steps in the problem-solving process. Hundreds of...
  • №297
  • 11,38 МБ
  • дата добавления неизвестна
  • изменен
McGraw-Hill, 2006. - 1008 Pages. Sixth Edition Discrete Mathematics and its Applications, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a...
  • №298
  • 19,99 МБ
  • дата добавления неизвестна
  • изменен
8th Edition. — McGraw Hill, 2019. — 1118 p. — ISBN 978-1-259-67651-2. Rosen's Discrete Mathematics and its Applications presents a precise relevant comprehensive approach to mathematical concepts. This world-renowned best-selling text was written to accommodate the needs across a variety of majors and departments including mathematics computer science and engineering. As the...
  • №299
  • 35,04 МБ
  • добавлен
  • изменен
Prepared by Jerrold Grossmann. Solutions manual to Rosen Kenneth. Discrete Mathematics and Its Applications. This Student's Solutions Guide for Discrete Mathematics and Its Applications, seventh edition, contains several useful and important study aids. Solutions To Odd-numbered Exercises The bulk of this work consists of solutions to all the odd-numbered exercises in the text....
  • №300
  • 29,29 МБ
  • добавлен
  • изменен
CRC Press, 2000. — 1183 pages. The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra,...
  • №301
  • 9,32 МБ
  • дата добавления неизвестна
  • изменен
2nd ed. — Boca Raton: CRC Press, 2017. — 1612 p. Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians. The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual...
  • №302
  • 10,69 МБ
  • добавлен
  • изменен
China Machine Press, 1999. — 700 p. A discrete mathematics course has more than one purpose. Students should learn a particular set of mathematical facts and how to apply them; more importantly, such a course should teach students how to think mathematically. To achieve these goals, this text stresses mathematical reasoning and the different ways problems and solved. Five...
  • №303
  • 34,36 МБ
  • дата добавления неизвестна
  • изменен
The McGraw-Hill, 2002. - 928 pages. 5th edition. ISBN-10: 0072424346 Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures,...
  • №304
  • 11,55 МБ
  • добавлен
  • изменен
Crc press, 2000. - 1183 pages. The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra,...
  • №305
  • 8,11 МБ
  • добавлен
  • изменен
7th edition. — McGraw-Hill, 2011. — 1072 p. На сайте выложен также Student's Solutions Guide Discrete Mathematics and its Applications, Seventh Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been...
  • №306
  • 36,21 МБ
  • добавлен
  • изменен
5th edition. — Prentice Hall, 2002. — 612 p. Informal but thorough in its coverage, this introduction to discrete mathematics offers a carefully graded treatment of the basics essential to computer science. This book presents a sound mathematical treatment that increases smoothly in sophistication. Key Topics: The book presents utility-grade discrete math tools so that any...
  • №307
  • 117,93 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2000, -272 pp. This text surveys many of the topics taught in discrete and finite mathematics courses. The topics chosen are widely applied in present-day industry and, at the same time, are mathematically elegant. Chapter 1 begins with such preliminaries as sets, mathematical induction, functions, and the division algorithm of algebra....
  • №308
  • 1,33 МБ
  • добавлен
  • изменен
London: Bentham Science Publishers, 2015. — 260 p. This e-book presents several basic methods and results of order theory that are currently used in various branches of mathematics. It presents topics that require a broad explanation in a concise and attractive way. Readers will easily identify problems/techniques/solutions without the frustration of long searches through previous...
  • №309
  • 2,25 МБ
  • добавлен
  • изменен
Издательство Springer, 1980, -152 pp. The idea underlying this book is that a -comprehensive theory of computing may be developed based on the mathematics of relations. At present, research in each area of the theory of computation is pursued using whatever mathematical equipment appears most appropriate. While this may be the optimal strategy for one area taken in isolation,...
  • №310
  • 731,54 КБ
  • добавлен
  • изменен
Springer, 1993. — 382. In July 1992, the International Symposium on Logic Synthesis and Microprocessor Architecture was held in Iizuka, Japan. The papers presented at the symposium were quite significant and we decided to publish the most outstanding of those concerned with Logic Synthesis and Optimization in textbook form for graduate students and young researchers. There...
  • №311
  • 8,39 МБ
  • добавлен
  • изменен
Издательство Addison-Wesley, 1998, -699 pp. Theoretical computer science treats any computational subject for which a good model can be created. Research on formal models of computation was initiated in the 1930s and 1940s by Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages, language translators, and operating systems were under development...
  • №312
  • 4,20 МБ
  • добавлен
  • изменен
Little, Brown and Company, 1982. — 226 p. Computability theory is concerned primarily with determining what tasks can be accomplished by idealized computer programs. Formal language theory deals primarily with the ability of certain grammars to express the syntax of various types of languages. Both fields are branches of formal mathematics. The former theory has its roots in...
  • №313
  • 3,68 МБ
  • добавлен
  • изменен
Little, Brown and Company, 1982. — 226 p. Computability theory is concerned primarily with determining what tasks can be accomplished by idealized computer programs. Formal language theory deals primarily with the ability of certain grammars to express the syntax of various types of languages. Both fields are branches of formal mathematics. The former theory has its roots in...
  • №314
  • 1,61 МБ
  • добавлен
  • изменен
Brooks Cole, 2012, 504 pp., ISBN: 9780840049421, Eng., 3rd Edition Master the fundamentals of discrete mathematics and proof-writing with mathematics: a discrete introduction. With a clear presentation, the mathematics text teaches you not only how to write proofs, but how to think clearly and present cases logically beyond this course. Though it is presented from a...
  • №315
  • 7,29 МБ
  • добавлен
  • изменен
Brooks Cole, 2005. — 592 p. This book has two primary objectives: It teaches students fundamental concepts in discrete mathematics (from counting to basic cryptography to graph theory), and it teaches students proof-writing skills. With a wealth of learning aids and a clear presentation, the book teaches students not only how to write proofs, but how to think clearly and...
  • №316
  • 21,56 МБ
  • дата добавления неизвестна
  • изменен
Издательство Springer, 1998, -327 pp. In the summer semester of 1993 at Universität Ulm, I tried out a new type of course, which I called Theory lab, as part of the computer science major program. As in an experimental laboratory with written preparatory materials (including exercises), as well as materials for the actual meeting, in which an isolated research result is...
  • №317
  • 1,57 МБ
  • добавлен
  • изменен
Springer, 2004. — 1920 p. The book by Gene Lawler from 1976 was the first of a series of books all entitled ‘Combinatorial Optimization’, some embellished with a subtitle: ‘Networks and Matroids’, ‘Algorithms and Complexity’, ‘Theory and Algorithms’. Why adding another book to this illustrious series? The justification is contained in the subtitle of the present book, ‘Polyhedra...
  • №318
  • 7,40 МБ
  • добавлен
  • изменен
Издательство Birkhäuser, 2003, -401 pp. Order theory can be seen formally as a subject between lattice theory and graph theory. Indeed, one can say with good reason that lattices are special types of ordered sets, which are in tum special types of directed graphs. Yet this would be much too simplistic an approach. In each theory the distinct strengths and weaknesses of the...
  • №319
  • 10,20 МБ
  • добавлен
  • изменен
Издательство Springer, 2009, -428 pp. The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years,...
  • №320
  • 4,50 МБ
  • добавлен
  • изменен
Chapman and Hall/CRC, 2018. — 604 р. — ISBN 978-1498738910. The Handbook of Geometric Constraint Systems Principles is an entry point to the currently used principal mathematical and computational tools and techniques of the geometric constraint system (GCS). It functions as a single source containing the core principles and results, accessible to both beginners and experts. The...
  • №321
  • 73,04 МБ
  • добавлен
  • изменен
Academic Press, 1973. 218 p. In spite of the large number of existing mathematical tables, until now there has been no table of sequences of integers Contents Preface Acknowledgments A bbrevia tions Description of the Book Description of a Typical Entry Arrangement Number of Terms Given References What Sequences Are Included? How Are Arrays of Numbers Treated?...
  • №322
  • 1,57 МБ
  • добавлен
  • изменен
Taylor & Francis, 2003. - 180 p. This work dealing with percolation theory clustering, criticallity, diffusion, fractals and phase transitions takes a broad approach to the subject, covering basic theory and also specialized fields like disordered systems and renormalization groups.
  • №323
  • 14,54 МБ
  • добавлен
  • изменен
Pearson Education, Inc. – 2011, 526 pages ISBN: 0132122715, 9780132122719 Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course. Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using...
  • №324
  • 3,92 МБ
  • добавлен
  • изменен
Cambridge Scholars Publishing, 2014. - 459 pages. ISBN: 978-1443856386 In today’s world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean...
  • №325
  • 3,85 МБ
  • добавлен
  • изменен
Springer, 2009. - 234 Pages. The field of binary Logics has two main areas of application, the Digital Design of Circuits (related to Electrical Engineering) and Propositional Logics (related to Mathematics, Artificial Intelligence, Complexity etc. ). In both cases it is quite possible to teach the theoretical foundations and to do some exercises, but in both cases the examples...
  • №326
  • 2,84 МБ
  • дата добавления неизвестна
  • изменен
Springer, 2006. - 127 p. ISBN: 1402046367 This book studies the situation over discrete Abelian groups with wide range applications. It covers classical functional equations, difference and differential equations, polynomial ideals, digital filtering and polynomial hypergroups, giving unified treatment of several different problems. There is no other comprehensive work in this...
  • №327
  • 8,46 МБ
  • добавлен
  • изменен
American Mathematical Society, 1987. — 318 p. — (Colloquium Publications). — ISBN: 0821810413, 9780821810415 Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only...
  • №328
  • 29,41 МБ
  • добавлен
  • изменен
New York: Chapman & Hall/CRC , 2015. - 1244p. The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both...
  • №329
  • 18,54 МБ
  • добавлен
  • изменен
Издательство Leibniz, 1998, -491 pp. The engineering advances of the second half of the 20th century have created an avalanche of new technology. Control and use of that technology require, among many things, effective computational methods for logic. This book proposes one such method. It is based on a new theory of logic computation. Main features of the theory are an...
  • №330
  • 3,16 МБ
  • добавлен
  • изменен
New York: Leibniz Company, 2015. — 406 p. Graduate students and researchers in combinatorics and matroid theory as well as computer scientists, graph theorists and scientific libraries may find this book useful. Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Since the mid-1950s, much progress has been made, and there now exists a large...
  • №331
  • 2,94 МБ
  • добавлен
  • изменен
Диссертация, Technische Universiteit Eindhoven, 1997, -156 pp. With the increasing complexity and tight time-to-market schedules of today’s digital systems, it is becoming more and more difficult to design correct circuits for these systems. Therefore, throughout the design process it is necessary to check that no errors are made. This task is called verification....
  • №332
  • 552,23 КБ
  • добавлен
  • изменен
New York: Franklin, Beedle & Associates, 2013. — 672 p. This book provides a distinct way to teach discrete mathematics. Since discrete mathematics is crucial for rigorous study in computer science, many texts include applications of mathematical topics to computer science or have selected topics of particular interest to computer science. This text fully integrates discrete...
  • №333
  • 60,95 МБ
  • добавлен
  • изменен
New Age Publications (Academic), 2007. - 577 Pages. All definitions and theorems in this text are stated extremely carefully so that students will appreciate the precision of language and rigor needed in mathematical sciences. Proofs are motivated and developed slowly, their steps are all carefully justified. Recursive definitions are explained and used extensively.
  • №334
  • 23,34 МБ
  • дата добавления неизвестна
  • изменен
4th edition. — New Age International, 2009. — 315 p. — ISBN: 8122425747 , 8122425062 The fourth edition retains all chapters of third edition and chapter 4: Ordered Sets and Lattices and chapter 10: Combinatorics as well as several sections on Set Theory, Boolean Algebra, Geometric Linear Transformation and Linear Equation are added. We have tried to emphasize that concept and...
  • №335
  • 2,20 МБ
  • добавлен
  • изменен
N.-Y.: Springer, 2010. - 119p. Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous...
  • №336
  • 684,18 КБ
  • добавлен
  • изменен
Издательство Springer, 1995, -287 pp. This introductory textbook presents an algorithmic and computability based approach to circuit complexity. Intertwined with the consideration of practical examples and the design of efficient circuits for these, a lot of care is spent on the formal development of the computation model of uniform circuit families and the motivation of the...
  • №337
  • 7,78 МБ
  • добавлен
  • изменен
American Mathematical Society, 2002, -195 pp. The theory of graph coloring has existed for more than 150 years. From a modest beginning of determining whether every geographic map can be colored with four colors, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Historically, graph coloring involved finding the...
  • №338
  • 1,73 МБ
  • добавлен
  • изменен
Издательство Nova Science Publishers, 2009, -303 pp. Graph Theory is an important area of contemporary mathematics with many applications in computer science, genetics, chemistry, engineering, industry, business and in social sciences. It is a young science invented and developing for solving challenging problems of computerized society for which traditional areas of mathematics...
  • №339
  • 9,21 МБ
  • добавлен
  • изменен
Pergamon Press, 1961. — 580 p. — ISBN: 0080095682, 9780080095684 The following pages contain a reprinting of all the articles published by John von Neumann, some of his reports to government agencies and to other organizations, and reviews of unpublished manuscripts found in his files. The published papers, especially the earlier ones, are given herein in essentially...
  • №340
  • 21,31 МБ
  • добавлен
  • изменен
Pergamon Press, 1961, 584 p. — ASIN: B00843PLXQ. Volume III : Rings of Operators—contains his work on, and closely related to, the theory of the rings of operators. Contents: On A Certain Topology for Rings of Operators. On RIngs of Operators. On rings of operators II. On rings of operators III. On rings of operators IV. On infinite direct products. On rings of...
  • №341
  • 20,18 МБ
  • добавлен
  • изменен
New York Oxford London Paris Pergamon Press, 1962. — 528 p. Volume IV : Continuous Geometry and other topics—includes the papers on continuous geometry, as well as papers written on a variety of mathematical topics. Also included in this volume are four papers on statistics, and reviews of a number of manuscripts found in his files.
  • №342
  • 18,99 МБ
  • добавлен
  • изменен
Pergamon Press, 1961. — 672 p. OCR, оглавление. The following pages contain a reprinting of all the articles published by John von Neumann, some of his reports to government agencies and to other organizations, and reviews of unpublished manuscripts found in his files. The published papers, especially the earlier ones, are given herein in essentially chronological order....
  • №343
  • 26,56 МБ
  • добавлен
  • изменен
Berlin: Springer, 1975. — 113 p. Matroid theory has its origin in a paper by H. Whitney entitled "On the abstract properties of linear dependence" , which appeared in 1935. The main objective of the paper was to establish the essential (abstract) properties of the concepts of linear dependence and independence in vector spaces, and to use these for the axiomatic definition of a...
  • №344
  • 2,79 МБ
  • добавлен
  • изменен
New York Oxford London Paris Pergamon Press, 1963. — 550 p. — ASIN: B000V294MC Volume VI : Theory of Games, Astrophysics, Hydrodynamics and Meteorology. Papers on these topics, as well as a number of articles based on speeches delivered by von Neumann, are included in this volume.
  • №345
  • 19,11 МБ
  • добавлен
  • изменен
Birkhauser, 2011. — 440 p. This second edition of A Beginner’s Guide to Discrete Mathematics presents a detailed guide to discrete mathematics and its relationship to other mathematical subjects including set theory, probability, cryptography, graph theory, and number theory. This textbook has a distinctly applied orientation and explores a variety of applications. Key...
  • №346
  • 3,56 МБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 2000, -419 pp. Research on the complexity of Boolean functions has a more than fifty-year-old history. For a long time, research has been focused on circuits and the circuit complexity of Boolean functions. The open problems in circuit complexity are now so hard that not much progress has been made during the past 10 years....
  • №347
  • 2,74 МБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 2000, -419 pp. Research on the complexity of Boolean functions has a more than fifty-year-old history. For a long time, research has been focused on circuits and the circuit complexity of Boolean functions. The open problems in circuit complexity are now so hard that not much progress has been made during the past 10 years....
  • №348
  • 8,06 МБ
  • добавлен
  • изменен
Издательство Springer, 2003, -332 pp. Spӓtestens seit der Entwicklung der NP-Vollstandigkeitstheorie ist die Komplexitatstheorie ein zentrales Lehr- und Forschungsgebiet der Informatik. Mit dem NP≠P-Problem beinhaltet sie eine der groβen intellektuellen Herausforderungen der Gegenwart . Im Gegensatz zu anderen Gebieten der Informatik, in denen oft suggeriert wird, dass mit...
  • №349
  • 13,65 МБ
  • добавлен
  • изменен
Издательство John Wiley, 1987, -469 pp. Различные аспекты теории сложности: булевы функции, схемы, формулы, программы итд. Булевы функции и схемы. Минимизация булевых функций. Разработка эффективных схем для некоторых важных функций. Асимптотики и универсальные схемы. Нижние границы сложности схем. Монотонные схемы. Связь между сложностью схем, сложностью формул и их...
  • №350
  • 1,88 МБ
  • дата добавления неизвестна
  • изменен
Издательство Cambridge University Press, 1993, -164 pp. These lecture notes are based on a series of lectures which I gave at the Advanced Research Institute of Discrete Applied Mathematics (ARIDAM VI) in June 1991. The lectures were addressed to an audience of discrete mathematicians and computer scientists. I have tried to make the material understandable to both groups; the...
  • №351
  • 2,32 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2008 - 337p. The theory of matroids is unique in the extent to which it connects such disparate branches of combinatorial theory and algebra as graph theory, lattice theory, design theory, combinatorial optimization, linear algebra, group theory, ring theory, and field theory. Furthermore, matroid theory is alone among mathematical...
  • №352
  • 2,80 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 1987. - 228p. A continuation of The Theory of Matroids, (edited by N. White), this volume consists of a series of related surveys by top authorities on coordinatizations, matching theory, transversal and simplicial matroids, and studies of important matroid variants. An entire chapter is devoted to matroids in combinatorial optimization, a...
  • №353
  • 10,39 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2009. - 376p. This volume, the third in a sequence that began with The Theory of Matroids (1986) and Combinatorial Geometries (1987), concentrates on the applications of matroid theory to a variety of topics from geometry (rigidity and lattices), combinatorics (graphs, codes, and designs) and operations research (the greedy algorithm)....
  • №354
  • 3,17 МБ
  • добавлен
  • изменен
A K Peters, 2006. - 245 pages. Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in. * Combinatorics. * Probability Theory. * Statistics. * Theory of Markov Chains. * Number Theory. One of the...
  • №355
  • 1,54 МБ
  • дата добавления неизвестна
  • изменен
University of Pennsylvania, 2000. - 35 pages. Contents. Overview. Basic Generating Functions. Identities and Asymptotics. Pentagonal Numbers and Prefabs. The Involution Principle. Remmel’s bijection machine. Sieve equivalence. Gordon’s algorithm. The accelerated algorithm of Kathy O’Hara. Equidistributed partition statistics. Counting the rational numbers....
  • №356
  • 285,60 КБ
  • добавлен
  • изменен
N.-Y.: Taylor&Francis, 1988. - 304p. This book makes the mathematical basis of formal methods accessible both to the student and to the professional. It is motivated in the later chapters by examples and exercises. Throughout, the premise is that mathematics is as essential to design and construction in software engineering as it is to other engineering disciplines. The...
  • №357
  • 12,17 МБ
  • добавлен
  • изменен
Chapman and Hall/CRC, 2019. — 284 р. The Beauty of Mathematics in Computer Science explains the mathematical fundamentals of information technology products and services we use every day, from Google Web Search to GPS Navigation, and from speech recognition to CDMA mobile services. The book was published in Chinese in 2011 and has sold more than 600,000 copies. Readers were...
  • №358
  • 3,54 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2018. — 70 p. — (SpringerBriefs in Electrical and Computer Engineering) — ISBN 3319604678. This brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks. First, in Chap. 1, the authors introduce the basic...
  • №359
  • 2,19 МБ
  • добавлен
  • изменен
Издательство Springer, 2004, -256 pp. Duration calculus (abbreviated to DC) represents a logical approach to the formal design of real-time systems. In DC, real numbers are used to model time, and Boolean-valued (i.e. {0,1}-valued) functions over time are used to model states of real-time systems. The duration of a state in a time interval is the accumulated presence time of...
  • №360
  • 1,79 МБ
  • добавлен
  • изменен
North-Holland, 1981. — 391 p. The object of this book is to provide an account of results and methods for linear and combinatorial optimization problems over ordered algebraic structures. In linear optimization the set of feasible solutions is described by a system of linear constraints; to a large extent such linear characterizations are known for the set of feasible...
  • №361
  • 2,99 МБ
  • добавлен
  • изменен
North-Holland, 1981. — 391 p. The object of this book is to provide an account of results and methods for linear and combinatorial optimization problems over ordered algebraic structures. In linear optimization the set of feasible solutions is described by a system of linear constraints; to a large extent such linear characterizations are known for the set of feasible...
  • №362
  • 3,82 МБ
  • добавлен
  • изменен
Minneapolis: University of Minnesota, 2014. - 100 p. A partially ordered set, or poset, is a set of elements and a binary relation which determines an order within elements. Various combinatorial properties of finite and ordered posets have been extensively studied during the last 4 decades. The Sperner property states that the size of the largest subset of pairwise incomparable...
  • №363
  • 12,59 МБ
  • добавлен
  • изменен
Учебное пособие. — Волгоград: ВолгГТУ, 2015. — 144 с. — ISBN 978-5-9948-1764-3 Излагаются основные положения дискретной математики; особое внимание уделяется разделам математической логики и теории графов, теории множеств и алгебраических структур; приведены примеры решения задач. Предназначено для студентов направления подготовки бакалавров «Приборостроение», изучающих курс...
  • №364
  • 5,51 МБ
  • добавлен
  • изменен
2-е изд., стер. — Волгоград: ВолгГТУ, 2016. — 160 с. — ISBN 978–5–9948–2086–5 Излагаются основные положения дискретной математики; особое внимание уделяется разделам математической логики и теории графов, теории множеств и алгебраических структур; приведены примеры решения задач. Предназначено для студентов направлений подготовки бакалавриата «Информатика и вычислительная...
  • №365
  • 8,49 МБ
  • добавлен
  • изменен
Учебное пособие. — Москва: Министерство образования и науки Российской Федерации "МАТИ" - Российский государственный технологический университет им. Циолковского К.Э., 2012. — 58 с. Учебное пособие посвящено изучению важных разделов дискретной математики: элементов теории множеств, бинарных отношений, элементов комбинаторики, теории булевых функций, графов. Его основы составляют...
  • №366
  • 960,56 КБ
  • добавлен
  • изменен
М.: Лаборатория базовых знаний, 2001. 352 с. Учебник по дискретной математике для студентов 1 курса, изучающих дискретную математику (в основном для студентов факультета информационных технологий). Аналогичный учебник 2003 года издания размером 65.97Mb выложил "Emilliane".
  • №367
  • 16,10 МБ
  • дата добавления неизвестна
  • изменен
2-е изд., доп. — М.: Лаборатория Базовых Знаний, 2003. — 376 с.: ил. — ISBN 5-93208-025-6. В книге излагаются основные разделы курса дискретной математики, имеющей большое значение для информатики и электроники. При подготовке книги использовался конструктивный подход, особое внимание автор уделил доступности материала. Текст снабжен большим количеством примеров. Книга...
  • №368
  • 65,97 МБ
  • дата добавления неизвестна
  • изменен
2-е изд., доп. - М.: Лаборатория базовых знаний. - 2001. - 376 с. В книге излагаются основные разделы курса дискретной математики, имеющей большое значение для информатики и электроники. При подготовке книги использовался конструктивный подход, особое внимание автор уделил доступности материала. Текст снабжен большим количеством примеров. Книга предназначена для студентов и...
  • №369
  • 9,41 МБ
  • дата добавления неизвестна
  • изменен
М.: Издатель Акимова, 2005. - 656 с. В учебном пособии излагаются основные разделы дискретной математики, являющейся базовой дисциплиной для специалистов по информатике, программированию, электротехнике, микроэлектронике, компьютерным сетям и технологиям. При изложении материала использовался конструктивный подход - наиболее современная и эффективная форма подачи материала....
  • №370
  • 24,62 МБ
  • дата добавления неизвестна
  • изменен
М.: Издатель Акимова, 2005. — 656 с. В учебном пособии излагаются основные разделы дискретной математики, являющейся базовой дисциплиной для специалистов по информатике, программированию, электротехнике, микроэлектронике, компьютерным сетям и технологиям. При изложении материала использовался конструктивный подход - наиболее современная и эффективная форма подачи материала. Текст...
  • №371
  • 8,36 МБ
  • добавлен
  • изменен