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: Yozshugis Nezragore
Country: Cayman Islands
Language: English (Spanish)
Genre: Automotive
Published (Last): 25 March 2007
Pages: 418
PDF File Size: 17.10 Mb
ePub File Size: 17.49 Mb
ISBN: 121-6-29341-431-8
Downloads: 58415
Price: Free* [*Free Regsitration Required]
Uploader: JoJojin

Wegener, Ingo

The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. Stefan EdelkampIngo Wegener: A covering problem for finite boolean lattices by Bernd Voigt Book 5 editions published informatii in English and German and held by 7 WorldCat member libraries worldwide.

Conference papers and proceedings. Suchprobleme by Rudolf Ahlswede Book 8 editions published between and in German and Russian and held by 83 WorldCat member rheoretische worldwide. Informatik Spektrum 28 2: Approximations by OBDDs and the variable ordering problem.

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. Optimal ordered binary decision diagrams for read-once wegenef.

  6ES7 223-1BL22-0XA0 PDF

Martin DietzfelbingerJonathan E. 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.

TeubnerISBN Kompendium Theoretische Informatik – eine Ideensammlung. Real royal road functions–where crossover provably is essential. On the complexity of minimizing the OBDD size for incompletely specified functions. Worst case examples for operations on OBDDs. Functions that have read-once branching programs of quadratic size are not necessarily testable.

Wegener, Ingo [WorldCat Identities]

Oliver GielIngo Wegener: The Ising Model on the Ring: On the complexity of the hidden weighted bit function for various BDD models. Evolutionary Computation 7 5: This book is the first comprehensive description of theory and applications. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations. LOG IN 17 6: Discrete Algorithms 3 1: 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 science 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.


Real royal road functions for constant population size.

Theoretische Informatik 1, WiSe 16/17

Informatica Didactica 2 An understanding of these limits prevents the search for non-existing efficient algorithms. A simplified correctness proof for a well-known algorithm computing strongly connected components.

An Stelle von formalen Beweisen werden die wesentlichen Ideen herausgearbeitet und vorgestellt. Discrete Applied Mathematics 74 2: Approximability and Nonapproximability by Binary Decision Diagrams.

The complexity of Boolean functions by Ingo Wegener Book 16 editions published in in English and held by WorldCat member libraries worldwide.

Statistics and Computing 16 2: Optimization with randomized theorteische heuristics – the A NFL theorem, realistic scenarios, and difficult functions.

Evolutionary Algorithms and the Maximum Matching Problem. AuthorEditorContributorInventordgsHonoree. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Precision, local search and unimodal functions.