» książki » Mathematics - Combinatorics
topmenu
 |
Coding Theory and Design Theory: Part I Coding Theory
ISBN: 9781461389965 / Angielski / Miękka / 239 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This IMA Volume in Mathematics and its Applications Coding Theory and Design Theory Part I: Coding Theory is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organizer, Dijen Ray-Chaudhuri, for organizing a workshop which brought together many of the major figures in a variety of research...
This IMA Volume in Mathematics and its Applications Coding Theory and Design Theory Part I: Coding Theory is based on the proceedings of a workshop wh...
|
cena:
402,53 |
 |
Applications of Combinatorics and Graph Theory to the Biological and Social Sciences
ISBN: 9781468463835 / Angielski / Miękka / 345 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organizers, Joel Cohen and Fred Roberts, for organizing a workshop which brought together many of the...
This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on t...
|
cena:
402,53 |
 |
Distance-Regular Graphs
ISBN: 9783642743436 / Angielski / Miękka / 495 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. This interplay between regularity and symmetry properties of graphs is the theme of this book. Starting from very elementary regularity properties, the concept of a distance-regular graph arises naturally as a common setting for regular graphs which are extremal in one sense or another. Several other...
Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspec...
|
cena:
563,56 |
 |
Jewels Are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa
ISBN: 9783642643040 / Angielski / Miękka / 379 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on behalf of the theoretical computer science community. The contributions are written by internationally recognized scientists and cover most of Salomaa's many research areas. Due to its representative selection of classic and cutting edge trends in theoretical computer science, the book constitutes a comprehensive state-of-the-art survey. The contributions are in such central areas as automata theory, algorithms and complexity, and combinatorics...
Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on b...
|
cena:
402,53 |
 |
Tournament Solutions and Majority Voting
ISBN: 9783642645617 / Angielski / Miękka / 256 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book is a survey on the problem of choosing from a tournament. It brings together under a unified and self-contained presentation results and concepts from Graph Theory, Choice Theory, Decision Science and Social Choice which were discovered in the last ten years. Classical scoring and ranking methods are introduced, including the Slater orderings, as well as new statistical methods for describing a tournament, graph-theoretical methods based on the covering relation and game-theoretical methods. As an illustration, results are applied to the classical problem of Majority Voting: How to...
This book is a survey on the problem of choosing from a tournament. It brings together under a unified and self-contained presentation results and con...
|
cena:
402,53 |
 |
Basic Concepts of Linear Order: Combinatorics for Computer Science
ISBN: 9781480250178 / Angielski / Miękka / 58 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present here the first of ten units of study used by the author to train beginning graduate students and advanced undergraduates for further study in the general topic of combinatorial algorithms. This unit of study focuses on mathematical concepts used to linearly order sets of objects. Our general approach is to focus on the "geometric" theory of algorithms by which we mean the use of graphical or pictorial ways to understand what is going on. This approach is both fun and powerful, preparing you to invent your own algorithms for a wide range of problems.
We present here the first of ten units of study used by the author to train beginning graduate students and advanced undergraduates for further study ...
|
cena:
21,96 |
 |
Sorting and Listing: Combinatorics for Computer Science
ISBN: 9781481042772 / Angielski / Miękka / 84 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. These units of study present the basics of sorting and listing from the point of view of combinatorial algorithms. We focus on mathematical concepts as well as on the vizualization of algorithms through the use of graphical and pictorial methods. Sorting and merging algorithms are discussed, including sorting networks. We study listing, ranking and unranking algorithms for the basic sets that serve as building blocks of combinatorics. This approach will give you the tools to invent your own algorithms for a wide range of problems.
These units of study present the basics of sorting and listing from the point of view of combinatorial algorithms. We focus on mathematical concepts a...
|
cena:
21,96 |
 |
Polya Counting Theory: Combinatorics for Computer Science
ISBN: 9781481100892 / Angielski / Miękka / 66 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The beautiful mathematical counting theory due originally to George Polya is developed and extended in this unit of study. We discuss many extensions of the classical results of Polya and address problems of actually constructing systems of distinct representatives under the constraints of symmetry. We focus on mathematical concepts as well as on the vizualization of algorithms through the use of graphical and pictorial methods."
The beautiful mathematical counting theory due originally to George Polya is developed and extended in this unit of study. We discuss many extensions ...
|
cena:
21,96 |
 |
Parameterized Complexity
ISBN: 9781461267980 / Angielski / Miękka / 533 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now...
The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conf...
|
cena:
1006,38 |
 |
An Introduction to Convex Polytopes
ISBN: 9781461270232 / Angielski / Miękka / 162 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The aim of this book is to introduce the reader to the fascinating world of convex polytopes. The highlights of the book are three main theorems in the combinatorial theory of convex polytopes, known as the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. All the background information on convex sets and convex polytopes which is m eded to under- stand and appreciate these three theorems is developed in detail. This background material also forms a basis for studying other aspects of polytope theory. The Dehn-Sommerville Relations are classical, whereas the...
The aim of this book is to introduce the reader to the fascinating world of convex polytopes. The highlights of the book are three main theorems in th...
|
cena:
201,24 |
 |
Walk Through Combinatorics, A: An Introduction to Enumeration and Graph Theory (Third Edition)
ISBN: 9789814460002 / Angielski / Miękka / 568 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area:...
This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercise...
|
cena:
233,17 |
 |
Dynamics of Algorithms
ISBN: 9781461270737 / Angielski / Miękka / 145 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The articles collected in this volume represent the contributions presented at the IMA workshop on "Dynamics of Algorithms" which took place in November 1997. The workshop was an integral part of the 1997 -98 IMA program on "Emerging Applications of Dynamical Systems." The interaction between algorithms and dynamical systems is mutually beneficial since dynamical methods can be used to study algorithms that are applied repeatedly. Convergence, asymptotic rates are indeed dynamical properties. On the other hand, the study of dynamical systems benefits enormously from having efficient...
The articles collected in this volume represent the contributions presented at the IMA workshop on "Dynamics of Algorithms" which took place in Novemb...
|
cena:
201,24 |
 |
Parallel Processing of Discrete Problems
ISBN: 9781461271659 / Angielski / Miękka / 243 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete and global optimization problems. The chapters in this volume cover a broad spectrum of recent research in parallel processing of discrete and related problems. The topics discussed include distributed branch-and-bound algorithms, parallel genetic algorithms for large scale discrete problems, simulated annealing, parallel branch-and-bound...
In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel c...
|
cena:
201,24 |
 |
Grid Generation and Adaptive Algorithms
ISBN: 9781461271918 / Angielski / Miękka / 189 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This IMA Volume in Mathematics and its Applications GRID GENERATION AND ADAPTIVE ALGORITHMS is based on the proceedings of a workshop with the same title. The work- shop was an integral part of the 1996-97 IMA program on "MATHEMAT- ICS IN HIGH-PERFORMANCE COMPUTING. " I would like to thank Marshall Bern (Xerox, Palo Alto Research Cen- ter), Joseph E. Flaherty (Department of Computer Science, Rensselaer Polytechnic Institute), and Mitchell Luskin (School of Mathematics, Uni- versity of Minnesota), for their excellent work as organizers of the meeting and for editing the proceedings. I also...
This IMA Volume in Mathematics and its Applications GRID GENERATION AND ADAPTIVE ALGORITHMS is based on the proceedings of a workshop with the same ti...
|
cena:
201,24 |
 |
Topology and Geometry in Polymer Science
ISBN: 9781461272526 / Angielski / Miękka / 206 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This IMA Volume in Mathematics and its Applications TOPOLOGY AND GEOMETRY IN POLYMER SCIENCE is based on the proceedings of a very successful one-week workshop with the same title. This workshop was an integral part of the 1995-1996 IMA program on "Mathematical Methods in Materials Science." We would like to thank Stuart G. Whittington, De Witt Sumners, and Timothy Lodge for their excellent work as organizers of the meeting and for editing the proceedings. We also take this opportunity to thank the National Science Foun- dation (NSF), the Army Research Office (ARO) and the Office of Naval...
This IMA Volume in Mathematics and its Applications TOPOLOGY AND GEOMETRY IN POLYMER SCIENCE is based on the proceedings of a very successful one-week...
|
cena:
402,53 |
 |
Physical Combinatorics
ISBN: 9781461271215 / Angielski / Miękka / 317 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Taking into account the various criss-crossing among mathematical subject, Physical Combinatorics presents new results and exciting ideas from three viewpoints; representation theory, integrable models, and combinatorics. This work is concerned with combinatorial aspects arising in the theory of exactly solvable models and representation theory. Recent developments in integrable models reveal an unexpected link between representation theory and statistical mechanics through combinatorics. Taking into account the various criss-crossing among mathematical subject, Physical Combinatorics presents new results and exciting ideas ... |
cena:
201,24 |
 |
The Seventh European Conference on Combinatorics, Graph Theory and Applications: Eurocomb 2013
ISBN: 9788876424748 / Angielski / Miękka / 600 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological...
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb...
|
cena:
112,72 |
 |
Greedoids
ISBN: 9783642634994 / Angielski / Miękka / 214 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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 |
 |
Combinatorial Reasoning: An Introduction to the Art of Counting
ISBN: 9781118652183 / Angielski / Twarda / 488 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Written by two well-known scholars in the field, Combinatorial Reasoning: An Introduction to the Art of Counting presents a clear and comprehensive introduction to the concepts and methodology of beginning combinatorics. Focusing on modern techniques and applications, the book develops a variety of effective approaches to solving counting problems. Balancing abstract ideas with specific topical coverage, the book utilizes real world examples with problems ranging from basic calculations that are designed to develop fundamental concepts to more challenging exercises that allow... Written by two well-known scholars in the field, Combinatorial Reasoning: An Introduction to the Art of Counting presents a clear and compre... |
cena:
562,23 |
 |
Erdös Centennial
ISBN: 9783642392856 / Angielski / Twarda / 720 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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 |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
