Wyniki wyszukiwania:
wyszukanych pozycji: 14
 |
ALGORITHMIC THEORY OF NUMBERS, GRAPHS AND CONVEXITY
ISBN: 9780898712032 / Angielski Termin realizacji zamówienia: ok. 30 dni roboczych (Dostawa w 2026 r.) Studies two algorithms in detail: the ellipsoid method and the simultaneous diophantine approximation method.
Studies two algorithms in detail: the ellipsoid method and the simultaneous diophantine approximation method.
|
cena:
233,17 |
 |
Combinatorial Problems and Exercises
ISBN: 9780821842621 / Angielski / Twarda / 2007 / 639 str. Termin realizacji zamówienia: ok. 30 dni roboczych (Dostawa w 2026 r.) Describes various techniques in combinatorics. This book is suitable for those who intend to start research in graph theory, combinatorics or their applications, and for those researchers who feel that combinatorial techniques might help them with their wo
Describes various techniques in combinatorics. This book is suitable for those who intend to start research in graph theory, combinatorics or their ap...
|
cena:
301,18 |
 |
Discrete Mathematics: Elementary and Beyond
ISBN: 9780387955841 / Angielski / Twarda / 2003 / 284 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Dostawa w 2026 r.) Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number... Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear progra... |
cena:
281,76 |
 |
Matching Theory
ISBN: 9780821847596 / Angielski / Twarda / 2009 / 547 str. Termin realizacji zamówienia: ok. 30 dni roboczych (Dostawa w 2026 r.) This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first...
This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and con...
|
cena:
340,05 |
 |
Discrete Mathematics: Elementary and Beyond
ISBN: 9780387955858 / Angielski / Miękka / 2003 / 284 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Dostawa w 2026 r.) Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number... Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear progra... |
cena:
201,24 |
 |
Erdös Centennial
ISBN: 9783642392856 / Angielski / Twarda / 2013 / 720 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Dostawa w 2026 r.) Paul Erdos was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the far-reaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole...
Paul Erdos was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, ...
|
cena:
724,58 |
 |
Graphs and Geometry
ISBN: 9781470450878 / Angielski Termin realizacji zamówienia: ok. 30 dni roboczych (Dostawa w 2026 r.) Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curves connecting them. The main message of this book is that such a representation is not merely a way to visualize the graph, but an important mathematical tool. It is obvious that this geometry is crucial in engineering, for example, if you want to understand rigidity of frameworks and mobility of mechanisms. But even if there is no geometry directly connected to the graph-theoretic problem, a well-chosen geometric embedding has mathematical meaning and applications in proofs and algorithms....
Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curves connecting them. The main message of this book ...
|
cena:
427,49 |
 |
Large Networks and Graph Limits
ISBN: 9780821890851 / Angielski / Twarda / 2012 / 475 str. Termin realizacji zamówienia: ok. 30 dni roboczych (Dostawa w 2026 r.) Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. To develop a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as "property testing" in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact...
Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. To develo...
|
cena:
427,49 |
 |
Combinatorial Problems and Exercises
ISBN: 9780444815040 / Angielski / Twarda / 1993 / 636 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych (Dostawa w 2026 r.) The aim of this book is to introduce a range of combinatorial methods for those who want to apply these methods in the solution of practical and theoretical problems. Various tricks and techniques are taught by means of exercises. Hints are given in a separate section and a third section contains all solutions in detail. A dictionary section gives definitions of the combinatorial notions occurring in the book.
Combinatorial Problems and Exercises was first published in 1979. This revised edition has the same basic structure but has been brought up to date with a series of exercises... The aim of this book is to introduce a range of combinatorial methods for those who want to apply these methods in the solution of practical and theor...
|
cena:
1522,90 |
 |
Diskrete Mathematik
ISBN: 9783540206538 / Niemiecki / Miękka / 2005 / 374 str. Termin realizacji zamówienia: ok. 10-14 dni roboczych (Dostawa w 2026 r.) Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographie, der linearen Programmierung, der Kodierungstheorie und Informatik. Dieses Buch richtet sich an Studenten der Mathematik und Informatik, die ein Gefuhl dafur entwickeln mochten, worumes in derMathematik geht, wobei Mathematik hilfreich sein kann, und mit welcher Art Fragen sich Mathematiker auseinandersetzen. Die Autoren stellen eine Anzahl ausgewahlter Ergebnisse und Methoden der diskreten Mathematik vor, hauptsachlich aus den Bereichen... Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographi... |
cena:
95,14 |
 |
Geometric Algorithms and Combinatorial Optimization
ISBN: 9783642782428 / Angielski / Miękka / 2011 / 362 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Dostawa w 2026 r.) Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of...
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as...
|
cena:
563,56 |
 |
Greedoids
ISBN: 9783642634994 / Angielski / Miękka / 2012 / 214 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Dostawa w 2026 r.) With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the...
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the unde...
|
cena:
201,24 |
 |
Greedoids
ISBN: 9783540181903 / Angielski / Twarda / 1991 / 211 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych (Dostawa w 2026 r.) With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the...
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the unde...
|
cena:
478,87 |
 |
Horizons of Combinatorics
ISBN: 9783642095894 / Angielski / Miękka / 2010 / 280 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Dostawa w 2026 r.) Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young... Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structu... |
cena:
402,53 |
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
