The problems of search, exploration, discovery, and identification are of key importance in a wide variety of applications, including engineering, computer science, economics, and information theory. Over the past 30 years a great deal of work has been done on search problems by scientists from several disciplines. This book brings together the results from a number of different fields to provide the first really comprehensive overview of the subject. Major emphasis is placed on applications in science and mathematics. Presents open problems and contains many suggestions for further reading.

Search Problems (Wiley Series in Discrete Mathematics and Optimization)

Science & Math

Wegener, Ingo

Ahlswede, Rudolf

Mathematics

wiley

Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises.

The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)

Computers & Technology

Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The representation size of important and selected functions is estimated, upper and lower bound techniques are studied, efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered. This book is the first comprehensive description of theory and applications. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Branching Programs and Binary Decision Diagrams: Theory and Applications (Monographs on Discrete Mathematics and Applications, Series Number 4)

Computer Science

Society for Industrial and Applied Mathematics

Theoretische Informatik: Eine algorithmenorientierte Einführung (Leitfäden und Monographien der Informatik) (German Edition)

Technology

Vieweg+Teubner Verlag

Kompendium Theoretische Informatik ― eine Ideensammlung (XLeitfäden der Informatik) (German Edition)

Theoretische Informatik - eine algorithmenorientierte Einführung

B.G. Teubner Verlag

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models All topics are considered from an algorithmic point of view stressing the implications for algorithm design

Complexity Theory: Exploring the Limits of Efficient Algorithms

Springer

Reference

Das Neue an dieser Einführung in die Theoretische Informatik ist die konsequent algorithmenorientierte Sichtweise, d.h. eine Umsetzung in praktisch und theoretisch effiziente Algorithmen wird angestrebt. Auf diese Weise bietet das Buch eine Einführung in die zentralen Gebiete der Theoretischen Informatik, wie sie in einer Einführungsvorlesung an deutschen Universitäten vorgesehen ist.

Theoretische Informatik: ― eine algorithmenorientierte Einführung (XLeitfäden der Informatik) (German Edition)

See the best price to sell, buy, or rent books by Wegener, Ingo. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Wegener, Ingo