Hakutulokset: Hakutulos
yhteensä 35 hakutulosta
Combinatorial Optimization
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 …
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
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 …
Applied Finite Group Actions
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 …
Topics in Discrete Mathematics
The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday ofProfessor Jarik Nešetril. Leading …
The Simplex Method
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 …
Linear Optimization and Extensions
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 …
Discrete and Computational Geometry
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. …
Graph Colouring and the Probabilistic Method
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment …
Geometric Discrepancy
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 …
New Trends in Discrete and Computational Geometry
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 …
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
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 …