Jiri Matousek - Böcker

This is an introductory textbook of linear programming, written mainly for students of computer science and mathematics. Our guiding phrase is, "what every theoretical computer scientist should know about linear programming".¿The book is relativel...

Läs mer »

This second edition of Invitation to Discrete Mathematics is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goa...

Läs mer »

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields s...

Läs mer »

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields s...

Läs mer »

This volume contains a collection of clever mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof in at most ten pages and can be rea...

Läs mer »

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields s...

Läs mer »

Mathematics is a concise introduction to six selected areas of 20th century mathematics providing numerous modern mathematical tools used in contemporary research in computer science, engineering, and other fields. The areas are: measure theory, h...

Läs mer »

A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. They are scattered in res...

Läs mer »

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 ...

Läs mer »

A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. They are scattered in res...

Läs mer »

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 ...

Läs mer »

Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the "e;most uniform"e; way of dis- tributing n points in the unit square? How big is the "e;irregularity"e; ne...

Läs mer »

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimizati...

Läs mer »

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimizati...

Läs mer »

This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include:¿ graph representations,¿structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.

Läs mer »

?This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include: graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.

Läs mer »