May 11, 2019 posted by

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: JoJoran Kilmaran
Country: Bahamas
Language: English (Spanish)
Genre: History
Published (Last): 18 September 2005
Pages: 49
PDF File Size: 20.39 Mb
ePub File Size: 9.74 Mb
ISBN: 112-9-15509-210-3
Downloads: 41032
Price: Free* [*Free Regsitration Required]
Uploader: Doulkis

This book is the first comprehensive description of theory and applications.

The topics selected have implications for concrete applications, and the significance of complexity theory for today’s computer science is stressed throughout. Discrete Applied Mathematics 91 Workshop on Boolean Functions and Theordtische. Teaching Nondeterminism as a Special Case of Randomization.

SpringerISBN [contents]. LOG IN 17 6: A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.

Project Page Feedback Known Problems. Suchprobleme by Rudolf Ahlswede Book informafik editions published between and in German and Russian and held by 83 WorldCat member libraries worldwide. Modified repeated median filters. Stefan EdelkampIngo Wegener: Discrete Applied Mathematics 74 2: On the complexity of minimizing the OBDD size for incompletely specified functions.


Most widely held works by Ingo Wegener. Precision, Local Search and Unimodal Functions.

SpringerISBNpp. Informatica Didactica 4 Computational Complexity 8 4: Stasys JuknaAlexander A. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book.

Books by Ingo Wegener

Mit diesem Wissen sollte der inhaltliche Einstieg ins Informatikstudium problemlos gelingen. Approximability and Nonapproximability by Binary Decision Diagrams. Technical University of Lnformatik, Germany. An understanding of these limits prevents the search for non-existing efficient algorithms. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

dblp: Ingo Wegener

Oliver GielIngo Wegener: The representation size of important and selected functions wegenwr 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. Surveys on topics of current interest are included as well as new research results. Automata, Languages and Programming vol. BDDs–design, analysis, complexity, and applications.

The Ising Model on wwgener Ring: Evolutionary algorithms – how to cope with plateaus of constant fitness and when to reject strings of the same fitness. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. Branching programs and binary decision diagrams: Discrete Applied Mathematics 50 2: Optimal ordered binary decision diagrams for read-once formulas.


Informatik Spektrum 18 2: Logic versus Approximation Darstellungsformen, Effizienz und Programmiermethodik nahe. Ingo Wegener deutscher Informatiker.

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

TeubnerISBN Towards a Theory of Randomized Search Heuristics. Optimal attribute-efficient learning of disjunction, parity, and threshold functions. Simon FischerIngo Wegener: Real royal road functions–where crossover provably is essential. The book provides complete coverage of the core issues in the field, especially in fuzzy logic and control as well as for evolutionary optimization algorithms including genetic programming, in a comprehensive and systematic way.

Searching Randomly for Maximum Matchings.