{"title":"Algorithms And Combinatorics","description":null,"products":[{"product_id":"strange-logic-of-random-graphs-book-joel-spencer-9783540416548","title":"The Strange Logic of Random Graphs","description":"The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zero-one law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The book will be of interest to graduate students and researchers in discrete mathematics.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49532518662417,"sku":"GOR013494518","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52128448774417,"sku":"NLS9783540416548","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540416544.jpg?v=1750773961"},{"product_id":"combinatorial-optimization-book-alexander-schrijver-9783540443896","title":"Combinatorial Optimization","description":"This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50245838569745,"sku":"CIN3540443894G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ LIKE_NEW \/ SBYB","offer_id":50797630685457,"sku":"CIN3540443894LN","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":53333684355345,"sku":"CIN3540443894VG","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540443894.jpg?v=1750903733"},{"product_id":"modern-cryptography-probabilistic-proofs-and-pseudorandomness-book-oded-goldreich-9783540647669","title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","description":"You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas­ cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to the art of designing and breaking encryption schemes (or \"secrecy codes\"), Modern Cryptography is concerned with the rigorous analysis of any system which should withstand malicious attempts to abuse it. We emphasize two aspects of the transition from classical to modern cryptography: ( 1) the wide­ ning of scope from one specific task to an utmost wide general class of tasks; and (2) the move from an engineering-art which strives on ad-hoc tricks to a scientific discipline based on rigorous approaches and techniques.","brand":"WoB","offers":[{"title":"US \/ WELL_READ \/ SBYB","offer_id":50404292722961,"sku":"CIN354064766XA","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ NEW \/ INGRAM","offer_id":51065074942225,"sku":"NIN9783540647669","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52147420365073,"sku":"NLS9783540647669","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/140397781X.jpg?v=1751096388"},{"product_id":"combinatorial-optimization-book-bernhard-korte-9783662560389","title":"Combinatorial Optimization","description":"This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.   This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51062901702929,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51062905241873,"sku":"NIN9783662560389","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52338412912913,"sku":"NLS9783662560389","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3662560380.jpg?v=1750730823"},{"product_id":"greedoids-book-bernhard-korte-9783642634994","title":"Greedoids","description":"Oh cieca cupidigia, oh ira folie, Che si ci sproni nella vita corta, E nell' eterna poi si mal c'immolle! o blind greediness and foolish rage, That in our fleeting life so goads us on And plunges us in boiling blood for ever! Dante, The Divine Comedy Inferno, XII, 17, 49\/51. On an afternoon hike during the second Oberwolfach conference on Mathematical Programming in January 1981, two of the authors of this book discussed a paper by another two of the authors (Korte and Schrader [1981]) on approximation schemes for optimization problems over independence systems and matroids. They had noticed that in many proofs the hereditary property of independence systems and matroids is not needed: it is not required that every subset of a feasible set is again feasible. A much weaker property is sufficient, namely that every feasible set of cardinality k contains (at least) one feasible subset of cardinality k - 1. We called this property accessibility, and that was the starting point of our investigations on greedoids.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52089224298769,"sku":"NLS9783642634994","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642634994.jpg?v=1756906322"},{"product_id":"new-trends-in-discrete-and-computational-geometry-book-janos-pach-9783642634499","title":"New Trends in Discrete and Computational Geometry","description":"Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis, and computer aided design. The book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. All authors are well-known experts in these fields. They give concise and self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. Most of the methods and results discussed in the book have not appeared in any previously published monograph. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms. Apart from mathematicians working in discrete and computational geometry this book will also be of great use to computer scientists and engineers, who would like to learn about the most recent results.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52142352924945,"sku":"NLS9783642634499","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642634499.jpg?v=1757579844"},{"product_id":"matroid-theory-and-its-applications-in-electric-network-theory-and-in-statics-book-andras-recski-9783662221457","title":"Matroid Theory and its Applications in Electric Network Theory and in Statics","description":"I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen- eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in- creased with the spread of computers. Classical analysis did not even consider problems where only a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con- siderable detail. Some questions of this type (for example, the determination of when the so called greedy algorithm is optimal) cannot even be answered without matroidal tools.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52143678816529,"sku":"NLS9783662221457","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783662221457.jpg?v=1757585507"},{"product_id":"geometry-of-cuts-and-metrics-book-michel-marie-deza-9783540616115","title":"Geometry of Cuts and Metrics","description":"Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc.   This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students.   From the Reviews:   \"This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields […]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. […] The longer one works with it, the more beautiful it becomes.\" Optima 56, 1997.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52148781383953,"sku":"NLS9783540616115","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540616115.jpg?v=1757604622"},{"product_id":"probabilistic-methods-for-algorithmic-discrete-mathematics-book-michel-habib-9783540646228","title":"Probabilistic Methods for Algorithmic Discrete Mathematics","description":"Leave nothing to chance. This cliche embodies the common belief that ran- domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba- bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus- sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech- niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) o.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52152847499537,"sku":"NLS9783540646228","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761625461009,"sku":"NIN9783540646228","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540646228.jpg?v=1757618060"},{"product_id":"topics-in-discrete-mathematics-book-martin-klazar-9783642070266","title":"Topics in Discrete Mathematics","description":"The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of Professor Jarik Nešetril. Leading experts have contributed survey and research  papers in the areas of Algebraic Combinatorics, Combinatorial  Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs, Homomorphisms, Graph Colorings and Graph Embeddings.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52332622676241,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52332623134993,"sku":"NLS9783642070266","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642070266.jpg?v=1758152222"},{"product_id":"combinatorial-optimization-book-bernhard-korte-9783642090929","title":"Combinatorial Optimization","description":"This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52332695126289,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52332695716113,"sku":"NLS9783642090929","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642090929.jpg?v=1758152425"},{"product_id":"geometric-algorithms-and-combinatorial-optimization-book-laszlo-lovasz-9783642782428","title":"Geometric Algorithms and Combinatorial Optimization","description":"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 optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52341356495121,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52341360361745,"sku":"NLS9783642782428","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642782428.jpg?v=1758171578"},{"product_id":"mathematics-of-ramsey-theory-book-jaroslav-nesetril-9783642729072","title":"Mathematics of Ramsey Theory","description":"One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theory are shared by logicians, set theorists and combinatorists, and have been successfully applied in other branches of mathematics. The whole subject is quickly developing and has some new and unexpected applications in areas as remote as functional analysis and theoretical computer science. This book is a homogeneous collection of research and survey articles by leading specialists. It surveys recent activity in this diverse subject and brings the reader up to the boundary of present knowledge. It covers virtually all main approaches to the subject and suggests various problems for individual research.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52350664212753,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52350667817233,"sku":"NLS9783642729072","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642729072.jpg?v=1758180337"},{"product_id":"sparsity-book-patrice-mendez-9783642427763","title":"Sparsity","description":"This is the first book devoted to the systematic study of sparse graphs and sparse finite structures.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52354295824657,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52354296348945,"sku":"NLS9783642427763","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642427763.jpg?v=1758183776"},{"product_id":"combinatorics-and-complexity-of-partition-functions-book-alexander-barvinok-9783319518282","title":"Combinatorics and Complexity of Partition Functions","description":"Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial  structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems.   The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52401452155153,"sku":"NLS9783319518282","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319518282.jpg?v=1758754751"},{"product_id":"optimal-interconnection-trees-in-the-plane-book-marcus-brazil-9783319139142","title":"Optimal Interconnection Trees in the Plane","description":"The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions.Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52432698442001,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52432699130129,"sku":"NLS9783319139142","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319139142.jpg?v=1759175725"},{"product_id":"applied-finite-group-actions-book-adalbert-kerber-9783642085222","title":"Applied Finite Group Actions","description":"Written by one of the top experts in the fields of combinatorics and representation theory, this book distinguishes itself from the existing literature by its applications-oriented point of view. Recent progress in this field, in particular in design and coding theory, is described.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52476214968593,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52476216082705,"sku":"NLS9783642085222","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642085222.jpg?v=1759843706"},{"product_id":"probabilistic-methods-for-algorithmic-discrete-mathematics-book-michel-habib-9783642084263","title":"Probabilistic Methods for Algorithmic Discrete Mathematics","description":"Leave nothing to chance. This cliche embodies the common belief that ran- domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba- bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus- sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech- niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) o.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52478364844305,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52478366318865,"sku":"NLS9783642084263","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642084263.jpg?v=1759847069"},{"product_id":"linear-optimization-and-extensions-book-manfred-padberg-9783540658337","title":"Linear Optimization and Extensions","description":"I was pleasantly surprised when I was asked by Springer-Verlag to prepare a second edition of this volume on Linear Optimization and Extensions, which - not exactly contrary to my personal expectations - has apparently been accepted reasonably weIl by the global optimization community. My objective in putting this book together was originally - and still is - to detail the major algorithmic ideas in linear optimization that have evolved in the past fifty years or so and that have changed the historical optimization \"landscape\" in substantial ways - both theoretically and computationally. While I may have overlooked the importance of some very recent developments - the work by Farid Alizadeh which generalizes linear programming to \"sem i-definite\" programming is perhaps a candidate for one of my omissions - I think that major new breakthraughs on those two fronts that interest me - theory and computation - have not occurred since this book was published originally. As a consequence I have restricted myself to a thorough re-working of the original manuscript with the goal of making it more readable. Of course, I have taken this opportunity to correct a few \"Schönheitsfehler\" of the first edition and to add some illustrations. The index to this volume has been extended substantially - to permit a hurried reader a quicker glance at the wealth of topics that were covered nevertheless already in the first edition. As was the case with the first edition, Dr.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52479369773329,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52479370756369,"sku":"NLS9783540658337","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540658337.jpg?v=1759848619"},{"product_id":"topics-in-discrete-mathematics-book-martin-klazar-9783540336983","title":"Topics in Discrete Mathematics","description":"Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs, Homomorphisms, Graph Colorings and Graph Embeddings.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52479808209169,"sku":"NLS9783540336983","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761618284817,"sku":"NIN9783540336983","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540336983.jpg?v=1759849263"},{"product_id":"modern-cryptography-probabilistic-proofs-and-pseudorandomness-book-oded-goldreich-9783642084324","title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","description":"You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas- cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to the art of designing and breaking encryption schemes (or secrecy codes), Modern Cryptography is concerned with the rigorous analysis of any system which should withstand malicious attempts to abuse it. We emphasize two aspects of the transition from classical to modern cryptography: ( 1) the wide- ning of scope from one specific task to an utmost wide general class of tasks; and (2) the move from an engineering-art which strives on ad-hoc tricks to a scientific discipline based on rigorous approaches and techniques.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52480520487185,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52480521732369,"sku":"NLS9783642084324","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642084324.jpg?v=1759850349"},{"product_id":"matrices-and-matroids-for-systems-analysis-book-kazuo-murota-9783540660248","title":"Matrices and Matroids for Systems Analysis","description":"This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. It serves also as a comprehensive presentation of the theory and application of mixed matrices.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52480920650001,"sku":"NLS9783540660248","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540660248.jpg?v=1759850952"},{"product_id":"strange-logic-of-random-graphs-book-joel-spencer-9783642074998","title":"The Strange Logic of Random Graphs","description":"The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zero-one law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The book will be of interest to graduate students and researchers in discrete mathematics.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52481358397713,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52481359610129,"sku":"NLS9783642074998","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642074998.jpg?v=1759851618"},{"product_id":"linear-optimization-and-extensions-book-manfred-padberg-9783642085116","title":"Linear Optimization and Extensions","description":"I was pleasantly surprised when I was asked by Springer-Verlag to prepare a second edition of this volume on Linear Optimization and Extensions, which - not exactly contrary to my personal expectations - has apparently been accepted reasonably weIl by the global optimization community. My objective in putting this book together was originally - and still is - to detail the major algorithmic ideas in linear optimization that have evolved in the past fifty years or so and that have changed the historical optimization \"landscape\" in substantial ways - both theoretically and computationally. While I may have overlooked the importance of some very recent developments - the work by Farid Alizadeh which generalizes linear programming to \"sem i-definite\" programming is perhaps a candidate for one of my omissions - I think that major new breakthraughs on those two fronts that interest me - theory and computation - have not occurred since this book was published originally. As a consequence I have restricted myself to a thorough re-working of the original manuscript with the goal of making it more readable. Of course, I have taken this opportunity to correct a few \"Schönheitsfehler\" of the first edition and to add some illustrations. The index to this volume has been extended substantially - to permit a hurried reader a quicker glance at the wealth of topics that were covered nevertheless already in the first edition. As was the case with the first edition, Dr.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52481844478225,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52481846182161,"sku":"NLS9783642085116","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642085116.jpg?v=1759852326"},{"product_id":"geometric-discrepancy-book-jiri-matousek-9783540655282","title":"Geometric Discrepancy","description":"Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the most uniform way of dis- tributing 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 of a given distribution, and discrepancy is a numerical parameter of a point set serving this purpose. Such questions were first tackled in the thirties, with a motivation com- ing from number theory. A more or less satisfactory solution of the basic discrepancy problem in the plane was completed in the late sixties, and the analogous higher-dimensional problem is far from solved even today. In the meantime, discrepancy theory blossomed into a field of remarkable breadth and diversity. There are subfields closely connected to the original number- theoretic roots of discrepancy theory, areas related to Ramsey theory and to hypergraphs, and also results supporting eminently practical methods and algorithms for numerical integration and similar tasks. The applications in- clude financial calculations, computer graphics, and computational physics, just to name a few. This book is an introductory textbook on discrepancy theory. It should be accessible to early graduate students of mathematics or theoretical computer science. At the same time, about half of the book consists of material that up until now was only available in original research papers or in various surveys.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52482782101777,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52482783412497,"sku":"NLS9783540655282","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540655282.jpg?v=1759853743"},{"product_id":"geometry-of-cuts-and-metrics-book-michel-marie-deza-9783642042942","title":"Geometry of Cuts and Metrics","description":"Cuts and metrics are well-known objects that arise-- independently, but with many deep and fascinating connections--in diverse fields. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52507757805841,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52507758297361,"sku":"NLS9783642042942","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642042942.jpg?v=1760350953"},{"product_id":"applied-finite-group-actions-book-adalbert-kerber-9783540659419","title":"Applied Finite Group Actions","description":"Also the present second edition of this book is an introduction to the theory of clas­ sification, enumeration, construction and generation of finite unlabeled structures in mathematics and sciences. Since the publication of the first edition in 1991 the constructive theory of un­ labeled finite structures has made remarkable progress. For example, the first- designs with moderate parameters were constructed, in Bayreuth, by the end of 1994 ([9]). The crucial steps were - the prescription of a suitable group of automorphisms, i. e. a stabilizer, and the corresponding use of Kramer-Mesner matrices, together with - an implementation of an improved version of the LLL-algorithm that allowed to find 0-1-solutions of a system of linear equations with the Kramer-Mesner matrix as its matrix of coefficients. of matrices of the The Kramer-Mesner matrices can be considered as submatrices form A\" (see the chapter on group actions on posets, semigroups and lattices). They are associated with the action of the prescribed group G which is a permutation group on a set X of points induced on the power set of X. Hence the discovery of the first 7-designs with small parameters is due to an application of finite group actions. This method used by A. Betten, R. Laue, A. Wassermann and the present author is described in a section that was added to the manuscript of the first edi­ tion.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52533035106577,"sku":"NLS9783540659419","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540659419.jpg?v=1760663316"},{"product_id":"matrices-and-matroids-for-systems-analysis-book-kazuo-murota-9783642039935","title":"Matrices and Matroids for Systems Analysis","description":"This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. It serves also as a comprehensive presentation of the theory and application of mixed matrices.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52534193422609,"sku":"NLS9783642039935","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642039935.jpg?v=1760667550"},{"product_id":"geometric-discrepancy-book-jiri-matousek-9783642039416","title":"Geometric Discrepancy","description":"Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the most uniform way of dis- tributing 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 of a given distribution, and discrepancy is a numerical parameter of a point set serving this purpose. Such questions were first tackled in the thirties, with a motivation com- ing from number theory. A more or less satisfactory solution of the basic discrepancy problem in the plane was completed in the late sixties, and the analogous higher-dimensional problem is far from solved even today. In the meantime, discrepancy theory blossomed into a field of remarkable breadth and diversity. There are subfields closely connected to the original number- theoretic roots of discrepancy theory, areas related to Ramsey theory and to hypergraphs, and also results supporting eminently practical methods and algorithms for numerical integration and similar tasks. The applications in- clude financial calculations, computer graphics, and computational physics, just to name a few. This book is an introductory textbook on discrepancy theory. It should be accessible to early graduate students of mathematics or theoretical computer science. At the same time, about half of the book consists of material that up until now was only available in original research papers or in various surveys.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52535750951185,"sku":"NLS9783642039416","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52976035266833,"sku":"NIN9783642039416","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642039416.jpg?v=1760672004"},{"product_id":"discrete-and-computational-geometry-book-boris-aronov-9783540003717","title":"Discrete and Computational Geometry","description":"An impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the 'founding fathers' of the area, on the occasion of their 2\/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52591992766737,"sku":"NLS9783540003717","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540003717.jpg?v=1761065028"},{"product_id":"combinatorics-and-complexity-of-partition-functions-book-alexander-barvinok-9783319847511","title":"Combinatorics and Complexity of Partition Functions","description":"Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial  structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems.   The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52599901225233,"sku":"NLS9783319847511","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319847511.jpg?v=1761087622"},{"product_id":"combinatorial-optimization-book-bernhard-korte-9783662585665","title":"Combinatorial Optimization","description":"This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52606074487057,"sku":"NLS9783662585665","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761909756177,"sku":"NIN9783662585665","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783662585665.jpg?v=1761260155"},{"product_id":"discrete-images-objects-and-functions-in-zn-book-klaus-voss-9783642467813","title":"Discrete Images, Objects, and Functions in Zn","description":"Voss' book which deals with theoretical problems of digital image processing is an indispensable source of information for all those who are involved in the design, implementation, and application of mathematically sound algorithms in image processing; it is written for engineers, mathematicians, and computer scientists. The author, who is a well-known expert in the field of digital image processing, presents important new research which generalizes the currently used two-dimensional theory to n dimensions.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52650677010705,"sku":"NLS9783642467813","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642467813.jpg?v=1762128612"},{"product_id":"graph-colouring-and-the-probabilistic-method-book-michael-molloy-9783540421399","title":"Graph Colouring and the Probabilistic Method","description":"Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.","brand":"WoB","offers":[{"title":"US \/ NEW \/ INGRAM","offer_id":52658043355409,"sku":"NIN9783540421399","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540421399.jpg?v=1762236646"},{"product_id":"irregularities-of-partitions-book-gabor-halasz-9783540505822","title":"Irregularities of Partitions","description":"The problem of uniform distribution of sequences initiated by Hardy, Little- wood and Weyl in the 1910's has now become an important part of number theory. This is also true, in relation to combinatorics, of what is called Ramsey- theory, a theory of about the same age going back to Schur. Both concern the distribution of sequences of elements in certain collection of subsets. But it was not known until quite recently that the two are closely interweaving bear- ing fruits for both. At the same time other fields of mathematics, such as ergodic theory, geometry, information theory, algorithm theory etc. have also joined in. (See the survey articles: V. T. S6s: Irregularities of partitions, Lec- ture Notes Series 82, London Math. Soc., Surveys in Combinatorics, 1983, or J. Beck: Irregularities of distributions and combinatorics, Lecture Notes Series 103, London Math. Soc., Surveys in Combinatorics, 1985. ) The meeting held at Fertod, Hungary from the 7th to 11th of July, 1986 was to emphasize this development by bringing together a few people working on different aspects of this circle of problems. Although combinatorics formed the biggest contingent (see papers 2, 3, 6, 7, 13) some number theoretic and analytic aspects (see papers 4, 10, 11, 14) generalization of both (5, 8, 9, 12) as well as irregularities of distribution in the geometric theory of numbers (1), the most important instrument in bringing about the above combination of ideas are also represented.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52661217558801,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52661218312465,"sku":"NLS9783540505822","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540505822.jpg?v=1762266979"},{"product_id":"systems-analysis-by-graphs-and-matroids-book-kazuo-murota-9783540176596","title":"Systems Analysis by Graphs and Matroids","description":"Recent technology involves large-scale physical or engineering systems consisting of thousands of interconnected elementary units. This monograph illustrates how engineering problems can be solved using the recent results of combinatorial mathematics through appropriate mathematical modeling. The structural solvability of a system of linear or nonlinear equations as well as the structural controllability of a linear time-invariant dynamical system are treated by means of graphs and matroids. Special emphasis is laid on the importance of relevant physical observations to successful mathematical modelings. The reader will become acquainted with the concepts of matroid theory and its corresponding matroid theoretical approach. This book is of interest to graduate students and researchers.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52661440938257,"sku":"NLS9783540176596","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52932498915601,"sku":"NIN9783540176596","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540176596.jpg?v=1762267436"},{"product_id":"simplex-method-book-karl-heinz-borgwardt-9783540170969","title":"The Simplex Method","description":"For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear programming problems. It is proba- bly that mathematical algorithm for which the most computation time on computers is spent. This fact explains the great interest of experts and of the public to understand the method and its efficiency. But there are linear programming problems which will not be solved by a given variant of the Simplex-Method in an acceptable time. The discrepancy between this (negative) theoretical result and the good practical behaviour of the method has caused a great fascination for many years. While the worst-case analysis of some variants of the method shows that this is not a good algorithm in the usual sense of complexity theory, it seems to be useful to apply other criteria for a judgement concerning the quality of the algorithm. One of these criteria is the average computation time, which amounts to an anal- ysis of the average number of elementary arithmetic computations and of the number of pivot steps. A rigid analysis of the average behaviour may be very helpful for the decision which algorithm and which variant shall be used in practical applications. The subject and purpose of this book is to explain the great efficiency in prac- tice by assuming certain distributions on the real-world -problems. Other stochastic models are realistic as well and so this analysis should be considered as one of many possibilities.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52662745006353,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52662746022161,"sku":"NLS9783540170969","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540170969.jpg?v=1762270238"},{"product_id":"greedoids-book-b-korte-9783540181903","title":"Greedoids","description":"This monograph attempts to unify different mathematical approaches and to lead the reader from fundamental results in matroid theory to the current state-of-the-art in open research problems. It reviews classical concepts from matroid theory and extends them to greedoids (\"greedy\" algorithms).","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52688422306065,"sku":"NLS9783540181903","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761650331921,"sku":"NIN9783540181903","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540181903.jpg?v=1762332876"},{"product_id":"boolean-function-complexity-book-stasys-jukna-9783642431449","title":"Boolean Function Complexity","description":"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 decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":53522043175185,"sku":"NLS9783642431449","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642431449.jpg?v=1778456678"},{"product_id":"boolean-function-complexity-book-stasys-jukna-9783642245077","title":"Boolean Function Complexity","description":"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 decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":53522083381521,"sku":"NLS9783642245077","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642245077.jpg?v=1778456852"}],"url":"https:\/\/www.worldofbooks.com\/en-gb\/collections\/algorithms-and-combinatorics-book-series.oembed?page=2","provider":"World of Books ","version":"1.0","type":"link"}