Mar - 12


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: Tygogis Kazralabar
Country: Laos
Language: English (Spanish)
Genre: Sex
Published (Last): 10 March 2017
Pages: 237
PDF File Size: 8.65 Mb
ePub File Size: 12.8 Mb
ISBN: 574-5-63138-866-4
Downloads: 14993
Price: Free* [*Free Regsitration Required]
Uploader: Vudomuro

Project Page Feedback Known Problems. 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.

The analysis of evolutionary algorithms on sorting and shortest paths problems. Discrete Algorithms 3 1: Ingo Wegener deutscher Theorteische. The book features surveys on Combinatorics about topics such as intersection theorems, which are not yet covered in textbooks, several contributions by leading experts in data compression, and relations to Natural Sciences are discussed.

The representation size of important and selected functions is estimated, upper and lower bound techniques are studied, efficient algorithms for operations on these thekretische are presented, and the limits of those techniques are considered. Bundeswettbewerb Informatik – Die Aufgaben der Endrunden und Detlef SielingIngo Wegener: Discrete Applied Mathematics 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: Conference papers and proceedings. Optimization with randomized search heuristics – the A NFL theorem, realistic scenarios, and difficult functions. Discrete Algorithms 4 1: Bounds on the Number of Knight’s Tours. Algebra, Boolean Algorithms Artificial intelligence Biology–Data processing Branching processes Coding theory Combinatorial analysis Computational complexity Computational intelligence Computer algorithms Computer engineering Computer programming Computers Computer thforetische Computer science–Mathematics Computer software Data structures Computer science Decision making Decision making–Mathematical models Electrical engineering Electronic data processing Engineering Formal languages Functions Game theory Information theory Logic design Machine theory Operations research Optical pattern recognition Programming languages Electronic computers Search theory Software engineering.

Surveys on topics of current interest are included as well as new research results. The complexity of symmetric functions in bounded-depth circuits by Bettina Brustmann Book 1 edition published in in German and held by 5 WorldCat member libraries worldwide.

Wegener, Ingo [WorldCat Identities]

Evolutionary Algorithms and the Maximum Matching Problem. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions.

This teoretische is the first comprehensive description of theory and applications. Stefan EdelkampIngo Wegener: The one-dimensional Ising model: Most widely held works by Ingo Wegener. Grenzen der Effizienz von Algorithmen.

Wegener, Ingo

A simplified correctness proof for a well-known algorithm computing strongly connected components. Analysis of composition complexity and how to obtain smaller canonical graphs.


A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. On the complexity of the hidden weighted bit function for various BDD models. Informatica Didactica 2 Workshop on Boolean Wehener and Applications.

Searching Randomly for Maximum Matchings. On the Complexity of Encoding in Analog Circuits. Complexity theory – exploring the limits of efficient algorithms. Modified repeated median filters. Functions that have inho branching programs of quadratic size are not necessarily testable. Real royal road functions for constant population size.

Informatik Spektrum 28 2: This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Theoretical Aspects of Evolutionary Algorithms. Approximability and Nonapproximability by Binary Decision Diagrams.

Books by Ingo Wegener (Author of The Complexity of Boolean Functions)

Frank NeumannIngo Wegener: Evolutionary algorithms – how to cope with plateaus of constant fitness and when to reject strings of the same fitness. On the complexity of minimizing the OBDD size for incompletely specified functions.

Jawahar JainK. Discrete Applied Mathematics 50 2: Worst case examples for operations on OBDDs. Informatik Spektrum 18 2: