» książki » Mathematics - Combinatorics
 |
Fete of Combinatorics and Computer Science
ISBN: 9783642135798 / Angielski / Twarda / 361 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating...
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientif...
|
cena:
383,73 zł |
 |
An Irregular Mind: Szemerédi Is 70
ISBN: 9783642144431 / Angielski / Twarda / 738 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Szemeredi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This volume is a celebration of Szemeredi's achievements and personality, on the occasion of his seventieth birthday. It exemplifies his extraordinary vision and unique way of thinking. A number of colleagues and friends, all top authorities in their fields, have contributed their latest research papers to this volume. The topics include extension and applications of the regularity lemma, the existence of k-term arithmetic progressions in various...
Szemeredi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This...
|
cena:
575,62 zł |
 |
Digraphs: Theory, Algorithms and Applications
ISBN: 9780857290410 / Angielski / Miękka / 795 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised, reorganised and updated, the book now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number... The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover ... |
cena:
326,17 zł |
 |
Philosophiae Naturalis Principia Mathematica (Latin Edition)
ISBN: 9781603863797 / Łaciński / Miękka / 568 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. An Unabridged Publication of the William Thomson and Hugh Blackburn (1871) Authorized Reprint of Newton's Final Edition, To Include 'De Mundi Systemate' (System of the World) at Book's End, with Comprehensive Index. (In Latin)
An Unabridged Publication of the William Thomson and Hugh Blackburn (1871) Authorized Reprint of Newton's Final Edition, To Include 'De Mundi Systemat...
|
cena:
146,97 zł |
 |
Boolean Functions: Cryptographic and Combinatorial Properties - Functions with Symmetry
ISBN: 9789814327138 / Angielski / Twarda / 420 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book discusses cryptographic and combinatorial properties of Boolean functions. Boolean functions are very easy to understand (but deep in analysis) and the subject covers significant amount of material in digital circuits, communication theory, VLSI design, computer science, coding theory and Mathematics. Boolean function is considered as one of the most basic building blocks in cryptographic system design. The properties that make a Boolean function suitable for a cryptographic system, are mostly combinatorial. We discuss these properties (e.g., balancedness, nonlinearity, correlation...
This book discusses cryptographic and combinatorial properties of Boolean functions. Boolean functions are very easy to understand (but deep in analys...
|
cena:
680,36 zł |
 |
Walk Through Combinatorics, A: An Introduction to Enumeration and Graph Theory (Third Edition)
ISBN: 9789814335232 / Angielski / Twarda / 568 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Suitable for an introductory combinatorics course lasting one or two semesters, this book includes an extensive list of problems, ranging from routine exercises to research questions. It walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some the progress made in the area.
Suitable for an introductory combinatorics course lasting one or two semesters, this book includes an extensive list of problems, ranging from routine...
|
cena:
462,03 zł |
 |
Counting: The Art of Enumerative Combinatorics
ISBN: 9781441929150 / Angielski / Miękka / 252 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available? At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to color the faces of a cube if k colors are available with each face having exactly one color? or How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that...
Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are...
|
cena:
218,72 zł |
 |
Counting and Configurations: Problems in Combinatorics, Arithmetic, and Geometry
ISBN: 9781441930538 / Angielski / Miękka / 392 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book can be seen as a continuation of Equations and Inequalities: El ementary Problems and Theorems in Algebra and Number Theory by the same authors, and published as the first volume in this book series. How ever, it can be independently read or used as a textbook in its own right. This book is intended as a text for a problem-solving course at the first or second-year university level, as a text for enrichment classes for talented high-school students, or for mathematics competition training. It can also be used as a source of supplementary material for any course dealing with...
This book can be seen as a continuation of Equations and Inequalities: El ementary Problems and Theorems in Algebra and Number Theory by the same auth...
|
cena:
402,93 zł |
 |
Counting
ISBN: 9789812380630 / Angielski / Twarda / 124 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. An introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Younger students and lay people who appreciate mathematics or puzzle solving, should also find the book interesting. The various problems and applications here should help build up proficiency in counting, and hone basic skills and techniques in general problem solving. Many of the problems avoid routine and the diligent reader will often discover more than one way of solving a particular problem, which is an important awareness in problem solving. The book is thus designed to...
An introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Younger students and lay people who...
|
cena:
182,78 zł |
 |
Research Trends in Combinatorial Optimization: Bonn 2008
ISBN: 9783642095474 / Angielski / Miękka / 562 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3 7,2008.Althoughthiswouldbeareasontolookback, wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is...
The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhel...
|
cena:
383,73 zł |
 |
Random Trees: An Interplay Between Combinatorics and Probability
ISBN: 9783211999141 / Angielski / Miękka / 458 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During the last years research related to (random) trees has been constantly increasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in different settings. The aim of this book is to provide a thorough introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. It should serve as a... Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. ... |
cena:
537,24 zł |
 |
Graph Theory
ISBN: 9781849966900 / Angielski / Miękka / 663 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory. The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning... |
cena:
230,22 zł |
 |
Formal Power Series and Algebraic Combinatorics: 12th International Conference, Fpsac'00, Moscow, Russia, June 2000, Proceedings
ISBN: 9783642086625 / Angielski / Miękka / 808 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers...
SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences th...
|
cena:
1151,28 zł |
 |
Global Methods for Combinatorial Isoperimetric Problems
ISBN: 9780521183833 / Angielski / Miękka / 250 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The study of combinatorial isoperimetric problems exploits similarities between discrete optimization problems and the classical continuous setting. Based on his many years of teaching experience, Larry Harper focuses on global methods of problem solving. His text will enable graduate students and researchers to quickly reach the most current state of research in this topic. Harper includes numerous worked examples, exercises and material about applications to computer science.
The study of combinatorial isoperimetric problems exploits similarities between discrete optimization problems and the classical continuous setting. B...
|
cena:
302,15 zł |
 |
Graphen Und Digraphen: Eine Einführung in Die Graphentheorie
ISBN: 9783211822678 / Niemiecki / Miękka / 305 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Dieses Buch ist aus Vorlesungen hervorgegangen, die der Autor regelmassig an der RWTH Aachen fur Studenten der Mathematik und Informatik gehalten hat. Folgende Themen werden ausfuhrlich behandelt: Baume, Euler- und Hamiltonsche Graphen, Matching- und Faktortheorie, Uberdeckungen, AbsorptionsmengeAn, planare Graphen, Kanten- und Eckenfarbungen, mehrfacher Zusammenhang und Netzwerktheorie. Das Werk bietet eine moderne und exakte Einfuhrung in die Theorie der endlichen Graphen und Digraphen, welche nahezu alle fundamentalen Begriffsbildungen und die wichtigsten klassischen Ergebnisse enthalt....
Dieses Buch ist aus Vorlesungen hervorgegangen, die der Autor regelmassig an der RWTH Aachen fur Studenten der Mathematik und Informatik gehalten hat....
|
cena:
179,30 zł |
 |
Fundamente Der Graphentheorie
ISBN: 9783211827741 / Niemiecki / Miękka / 446 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Dieses Buch stellt eine umfassende und leicht lesbare Einfuhrung in die Graphentheorie dar, die aus einer zehnjahrigen Lehr- und Forschungstatigkeit des Autors hervorgegangen ist. Durch sorgfaltige Uberarbeitung, bedeutende Erweiterungen und Aktualisierungen seines ersten Lehrbuches "Graphen und Digraphen" hat der Autor sein zweites Werk zu diesem Thema geschaffen. Das Hauptziel ist es, dem Leser, insbesondere dem Studierenden, Methoden zu ubermitteln und ihn fur graphentheoretisches Denken zu interessieren. Obwohl der Text nur Vertrautheit mit Elementarmathematik (Grundbegriffe der...
Dieses Buch stellt eine umfassende und leicht lesbare Einfuhrung in die Graphentheorie dar, die aus einer zehnjahrigen Lehr- und Forschungstatigkeit d...
|
cena:
179,30 zł |
 |
Kombinatorik: II: Matroide Und Transversaltheorie
ISBN: 9783540079491 / Niemiecki / Miękka Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
204,40 zł |
 |
Relationen Und Graphen
ISBN: 9783540503040 / Niemiecki / Miękka / 306 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Dieses Buch gibt eine neuartige systematische Darstellung der Diskreten Mathematik; sie orientiert sich an Methoden der Relationenalgebra. Ahnlich wie man es sonst nur fur die weit entwickelte Analysis im kontinuierlichen Fall und die Matrizenrechnung gewohnt ist, stellt dieses Buch auch fur die Behandlung diskreter Probleme geeignete Techniken und Hilfsmittel sowie eine einheitliche Theorie bereit. Die einzelnen Kapitel beginnen jeweils mit anschaulichen und motivierenden Beispielen und behandeln anschliessend den Stoff in mathematischer Strenge. Es folgen jeweils praktische Anwendungen....
Dieses Buch gibt eine neuartige systematische Darstellung der Diskreten Mathematik; sie orientiert sich an Methoden der Relationenalgebra. Ahnlich wie...
|
cena:
197,22 zł |
 |
Combinatorial Algorithms: 21st International Workshop, Iwoca 2010, London, Uk, July 26-28, 2010, Revised Selected Papers
ISBN: 9783642192210 / Angielski / Miękka / 418 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010.
The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such... This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in Lon...
|
cena:
191,85 zł |
 |
Ottimizzazione Combinatoria: Teoria E Algoritmi
ISBN: 9788847015227 / Włoski / Miękka / 664 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto i risultati teorici e gli algoritmi che, al contrario delle euristiche, hanno una garanzia di avere buone prestazioni. Comprende una vasta scelta di argomenti e nasce come riferimento di diversi corsi di ottimizzazione combinatoria sia di base che di livello avanzato. Il libro contiene dimostrazioni complete (ma concise) anche di molti risultati avanzati, alcuni dei quali non sono mai apparsi prima in un libro. Vengono anche trattati molti dei temi di ricerca pi attuali e sono riportati... Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto i risultati teorici e gli algoritmi che, al contrario delle euri... |
cena:
184,33 zł |
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
