Algorithmics for Hard Problems

Author: Juraj Hromkovič
Publisher: Springer Science & Business Media
ISBN: 9783662046166
Release Date: 2013-03-14
Genre: Computers

An introduction to the methods of designing algorithms for hard computing tasks, concentrating mainly on approximate, randomized, and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. This is the first book to systematically explain and compare all the main possibilities of attacking hard computing problems. It also closes the gap between theory and practice by providing at once a graduate textbook and a handbook for practitioners dealing with hard computing problems.

Verification of Reactive Systems

Author: Klaus Schneider
Publisher: Springer Science & Business Media
ISBN: 3540002960
Release Date: 2004
Genre: Computers

This book is a solid foundation of the most important formalisms used for specification and verification of reactive systems. In particular, the text presents all important results on m-calculus, w-automata, and temporal logics, shows the relationships between these formalisms and describes state-of-the-art verification procedures for them. It also discusses advantages and disadvantages of these formalisms, and shows up their strengths and weaknesses. Most results are given with detailed proofs, so that the presentation is almost self-contained. Includes all definitions without relying on other material Proves all theorems in detail Presents detailed algorithms in pseudo-code for verification as well as translations to other formalisms

Theoretical Computer Science

Author: Juraj Hromkovič
Publisher: Springer Science & Business Media
ISBN: 3540140158
Release Date: 2003-09-18
Genre: Computers

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.

Combinatorial Optimization

Author: Christos H. Papadimitriou
Publisher: Courier Corporation
ISBN: 9780486320137
Release Date: 2013-04-26
Genre: Mathematics

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

Probability and Computing

Author: Michael Mitzenmacher
Publisher: Cambridge University Press
ISBN: 0521835402
Release Date: 2005-01-31
Genre: Computers

Randomization and probabilistic techniques play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communication networks and secure protocols.Assuming only an elementary background in discrete mathematics, this textbook is designed to accompany a one- or two-semester course for advanced undergraduates or beginning graduate students in computer science and applied mathematics. It gives an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses, including random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics.

Parameterized Complexity Theory

Author: J. Flum
Publisher: Springer Science & Business Media
ISBN: 354029953X
Release Date: 2006-05-01
Genre: Computers

This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. It presents detailed proofs of recent advanced results that have not appeared in book form before and replaces the earlier publication "Parameterized Complexity" by Downey and Fellows as the definitive book on this subject. The book will interest computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.

Computational Complexity

Author: Christos H. Papadimitriou
Publisher: MacMillan Publishing Company
ISBN: 0020153082
Release Date: 1994
Genre: Computational complexity

The first unified introduction and reference for the field of computational complexity. Virtually non-existent only 25 years ago, computational complexity has expanded tremendously and now comprises a major part of the researh activity in theoretical science.

Art of Turquoise

Author: Mary Emmerling
Publisher: Gibbs Smith
ISBN: 9781423616313
Release Date: 2011-05-01
Genre: Art

Turquoise and silver is an icon of the American Southwest. For generations, people have ogled these gemstones in pawn shops, jewelry shops and antiques stores, looking for a special piece of Native American jewelry that speaks to their heart. Southwest jewelry is now valued and collected around the world. Photographs of collectible pieces reveal what the attraction is about. Whether in shades of pale aqua or deeper aquamarine, blue or jade green, Mary Emmerling reveals that the collector's hunt is about color. And beyond jewelry, the color turquoise appears throughout the Southwest in architecture and decoration. After all, it's the color of calm.

Twenty Lectures on Algorithmic Game Theory

Author: Tim Roughgarden
ISBN: 9781316624791
Release Date: 2016-08-31
Genre: Business & Economics

This accessible introduction features case studies in online advertising, spectrum auctions, kidney exchange, and network management.

Introduction to the Theory of Complexity

Author: Daniele Bovet
Publisher: Prentice Hall PTR
ISBN: 0139153802
Release Date: 1994
Genre: Mathematics

The aim of this book is to review in a systematic way the most significant results obtained in the study of computational complexity theory. A balanced approach which is partly algorithmic and partly structuralist is followed. From an algorithmic point of view, the book is concerned with properties of complexity classes, and identification of structural properties of sets that affect their computational complexity.

Stochastic Local Search

Author: Holger H. Hoos
Publisher: Morgan Kaufmann
ISBN: 9781558608726
Release Date: 2005-01-01
Genre: Business & Economics

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a systematic treatment of SLS algorithms, this book examines the general concepts and specific instances of SLS algorithms and considers their development, analysis and application.

Mathematics and Computer Science III

Author: Michael Drmota
Publisher: Birkhäuser
ISBN: 9783034879156
Release Date: 2012-12-06
Genre: Computers

Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers.

Graphs and Algorithms in Communication Networks

Author: Arie Koster
Publisher: Springer Science & Business Media
ISBN: 9783642022500
Release Date: 2009-12-01
Genre: Computers

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.