Jan. (Eine elektronische Version dieses Buches ist frei verfügbar). I. Wegener. Theoretische Informatik – eine algorithmenorientierte Einführung. Ingo Wegener has expertise in Engineering and Psychology. dass die genannten Gebiete der theoretischen Informatik ganz konkrete Anwendungen haben. Homepage der Vorlesung Theoretische Informatik 1, WS / Akademischer Verlag, ; Ingo Wegener, Theoretische Informatik, Teubner,

Author: Jushicage Daigul
Country: Anguilla
Language: English (Spanish)
Genre: Politics
Published (Last): 14 January 2013
Pages: 143
PDF File Size: 8.63 Mb
ePub File Size: 2.79 Mb
ISBN: 893-2-61773-771-4
Downloads: 59154
Price: Free* [*Free Regsitration Required]
Uploader: Takora

Computational Complexity 16 3: Highlights aus der Informatik: A comparison of inofrmatik annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. BDDs–design, analysis, complexity, and applications.

Efficient data structures for Boolean functions. Discrete Algorithms 4 1: This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. Formal Methods in System Design 19 3: Tight Bounds for Blind Search on the Integers. Surveys on topics of current interest are included as well as new research results. Optimal ordered binary decision diagrams for read-once formulas.

Informatik Wegenet 28 2: New branches of complexity theory continue to arise in response to new algo-rithmic concepts, and its results – such as the theory of NP-completeness – have influenced the development of all areas of computer science. Beate BolligIngo Wegener: Advanced students and professionals interested in learning about and applying advanced techniques of computational intelligence will appreciate the book as a useful gheoretische enhanced by numerous examples and applications in a variety of fields.


Wegener, Ingo

The one-dimensional Ising model: Towards a Theory of Randomized Search Heuristics. SpringerISBN [contents]. Automata, languages and programming: Thomas JansenKenneth A. Juraj HromkovicIngo Inrormatik Real royal road functions for constant population size.

Theoretische Informatik 1, WiSe 16/17

Functions that have read-once branching programs of quadratic size are not necessarily testable. Informatica Didactica 2 SpringerISBNpp. The representation size of important and selected functions is estimated, upper ungo lower bound techniques are studied, efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered. Solution of the knight’s Hamiltonian path problem on chessboards.

Natural Computing 5 3: Jawahar JainK.

Stasys JuknaAlexander A. On the Complexity of Encoding in Analog Circuits. On the complexity of minimizing the OBDD size for incompletely specified functions.

Evolutionary Computation 6 2: Statistics and Computing 16 2: Most widely held works by Ingo Wegener. Informatik Spektrum 18 2: Thomas JansenIngo Wegener: Informatica Didactica 4 This book will become a valuable source of reference for researchers active in computational intelligence. The book features surveys on Combinatorics about topics such as infformatik theorems, which are not yet covered in textbooks, several contributions by leading experts in data compression, and relations to Natural Sciences are discussed.


Books by Ingo Wegener

Informatio Randomly for Maximum Matchings. The Ising Model on the Ring: How to analyse evolutionary algorithms.

Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book.

Automata, Languages and Programming vol. Warum, wie und durch wen?. Precision, local search and unimodal functions. Simple Evolutionary Algorithms as Adaptation Schemes. Tobias StorchIngo Wegener: An understanding of these limits prevents the search for non-existing efficient algorithms.

dblp: Ingo Wegener

Kompendium Theoretische Informatik – eine Ideensammlung. Project Page Feedback Known Problems. Approximability and Nonapproximability by Binary Decision Diagrams. A simplified correctness proof for a well-known algorithm computing strongly connected components. Complexity theory – exploring the limits of efficient algorithms.