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.

Taschenbuch der Mathematik

Author: Eberhard Zeidler
Publisher: Springer-Verlag
ISBN: 9783835101234
Release Date: 2012-10-23
Genre: Mathematics

Das Vieweg+Teubner Taschenbuch der Mathematik erfüllt aktuell, umfassend und kompakt alle Erwartungen, die an ein mathematisches Nachschlagewerk gestellt werden. Es vermittelt ein lebendiges und modernes Bild der heutigen Mathematik. Als Taschenbuch begleitet es die Bachelor-Studierenden vom ersten Semester bis zur letzten Prüfung und der Praktiker nutzt es als ständiges und unentbehrliches Nachschlagewerk in seinem Berufsalltag. Das Taschenbuch bietet alles, was in Bachelor-Studiengängen im Haupt- und Nebenfach Mathematik benötigt wird. Der Text für diese Ausgabe wurde stark überarbeitet. Zu spezielle Inhalte wurden herausgenommen und dafür Themen der Wirtschaftsmathematik und Algorithmik hinzugenommen. Das Vieweg+Teubner Handbuch der Mathematik (eAusgabe) enthält darüberhinaus ergänzendes und weiterführendes Material für das Masterstudium.

Springer Handbuch der Mathematik III

Author: Eberhard Zeidler
Publisher: Springer-Verlag
ISBN: 9783658002756
Release Date: 2012-12-13
Genre: Mathematics

Als mehrbändiges Nachschlagewerk ist das Springer-Handbuch der Mathematik in erster Linie für wissenschaftliche Bibliotheken, akademische Institutionen und Firmen sowie interessierte Individualkunden in Forschung und Lehre gedacht. Es ergänzt das einbändige themenumfassende Springer-Taschenbuch der Mathematik (ehemaliger Titel Teubner-Taschenbuch der Mathematik), das sich in seiner begrenzten Stoffauswahl besonders an Studierende richtet. Teil III des Springer-Handbuchs enthält neben den Kapiteln 5-9 des Springer-Taschenbuchs zusätzliches Material zu stochastischen Prozessen.​

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

Complexity Theory and Cryptology

Author: Jr̲g Rothe
Publisher: Springer Science & Business Media
ISBN: 9783540221470
Release Date: 2005-07-22
Genre: Computers

Modern cryptology more and more employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory often are motivated by questions and problems from cryptology. This book takes account of this situation and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.

Duration Calculus

Author: Chaochen Zhou
Publisher: Springer Science & Business Media
ISBN: 9783662067840
Release Date: 2013-03-14
Genre: Computers

A comprehensive introduction to interval logic and duration calculus for modelling, analysing and verifying real-time systems. The Duration Calculus (DC) represents a logical approach to formal design of real-time systems. In DC real numbers are used to model time and Boolean-valued (i.e. {0,1}-valued) functions over time to model states of real-time systems. The duration of a state in a time interval is the accumulated presence time of the state in the interval. DC extends interval logic to a calculus to specify and reason about properties of state durations. The text covers theory (completeness, decidability, undecidability, model-checking), results, as well as case studies (Deadline Driven Scheduler).

Restricted Orientation Convexity

Author: Eugene Fink
Publisher: Springer Science & Business Media
ISBN: 9783642188497
Release Date: 2012-12-06
Genre: Computers

Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. The authors explore the properties of this generalized convexity in multidimensional Euclidean space, and describ restricted-orientation analogs of lines, hyperplanes, flats, halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. They then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to that of standard convexity.

Semantic Integration of Heterogeneous Software Specifications

Author: Martin Große-Rhode
Publisher: Springer Science & Business Media
ISBN: 9783662098530
Release Date: 2013-03-09
Genre: Computers

The first book to integrate various model-based software specification approaches. The integration approach is based on a common semantic domain of abstract systems, their composition and development. Its applicability is shown through semantic interpretations and compositional comparisons of different specification approaches. These range from formal specification techniques like process calculi, Petri nets and rule-based formalisms to semiformal software modeling languages like those in the UML family.

Extremal Combinatorics

Author: Stasys Jukna
Publisher: Springer Science & Business Media
ISBN: 9783662046500
Release Date: 2013-03-09
Genre: Computers

This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.

Combinatorial Algorithms

Author: Thierry Lecroq
Publisher: Springer
ISBN: 9783642452789
Release Date: 2013-11-26
Genre: Computers

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

Finite Model Theory and Its Applications

Author: Erich Grädel
Publisher: Springer Science & Business Media
ISBN: 9783540004288
Release Date: 2007-04-24
Genre: Computers

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero–one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic,which emp- sizes the continuity in spirit and technique with ?nite model theory.

The Complexity Theory Companion

Author: Lane Hemaspaandra
Publisher: Springer Science & Business Media
ISBN: 9783662048801
Release Date: 2013-03-14
Genre: Computers

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.

Process Algebra with Timing

Author: J.C.M. Baeten
Publisher: Springer Science & Business Media
ISBN: 9783662049952
Release Date: 2013-03-09
Genre: Computers

Timing issues are of growing importance for the conceptualization and design of computer-based systems. Timing may simply be essential for the correct behaviour of a system, e.g. of a controller. Even if timing is not essential for the correct behaviour of a system, there may be good reasons to introduce it in such a way that suitable timing becomes relevant for the correct behaviour of a complex system. This book is unique in presenting four algebraic theories about processes, each dealing with timing from a different point of view, in a coherent and systematic way. The timing of actions is either relative or absolute and the underlying time scale is either discrete or continuous.

Theory of Semi Feasible Algorithms

Author: Lane Hemaspaandra
Publisher: Springer Science & Business Media
ISBN: 9783662050804
Release Date: 2013-04-17
Genre: Computers

The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.

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.