Suche einschränken:
Zur Kasse

4 Ergebnisse.

Understanding Computation

Heath, Lenwood S. / Rosenberg, Arnold L.
Understanding Computation
Computation theory is a discipline that uses mathematical concepts and tools to expose the nature of "computation" and to explain a broad range of computational phenomena: Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? How does one reason about such questions? This unique textbook strives to endow stude...

CHF 109.00

Understanding Computation

Heath, Lenwood S. / Rosenberg, Arnold L.
Understanding Computation
Computation theory is a discipline that uses mathematical concepts and tools to expose the nature of "computation" and to explain a broad range of computational phenomena: Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? How does one reason about such questions? This unique textbook strives to endow stude...

CHF 134.00

Graph Separators, with Applications

Heath, Lenwood S. / Rosenberg, Arnold L.
Graph Separators, with Applications
Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bo...

CHF 134.00

Graph Separators, with Applications

Heath, Lenwood S. / Rosenberg, Arnold L.
Graph Separators, with Applications
Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bo...

CHF 134.00