Ingo Wegener (260 results)

Broschiert. Condition: Gut. 328 S. : 22 graph. Darst. ; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Einband folienkaschiert. Sprache: Deutsch Gewicht in Gramm: 385.…

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

8°, kart. Sprache: Deutsch.

Condition: sehr gut. IX, 261 S., Abb., 23 cm. Sprache: Deutsch.

Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Hardcover. Condition: As New. Leichte Kratzer / Abnutzungen / Druckstellen. Dieser Band enthält die Beiträge einer Ringvorlesung Highlights aus der Informatik an der Universität Dortmund, in der Wissenschaftler, die durch ihre Forschung und didaktischen Fähigkeiten ausgewiesen sind, Glanzlichter aus der neueren Informatikforschung aufbereiteten und sie so Studenten und interessierten Laien zugänglich gemacht haben. Dabei wird das ganze Spektrum von tiefliegenden theoretischen Ergebnissen über anwendungsorientierte Entwicklungen bis zur überraschenden Lösung altbekannter kombinatorischer Probleme behandelt. Die Autoren zeigen kenntnisreich und bisweilen humorvoll, wie aufregend aktuelle Forschung sein kann.…

Hardcover. Condition: Sehr gut. Schutzumschlag. Transl. by J.E. Wotschke. Chichester (1987). XI, 284 p. OCloth in dust jacket. (edge slightly browned).- Wiley-Interscience Series in Discrete Mathematics and Optimization.- Incl. bibliography.- Name and pencil annotations on flyleaf.ch.

hardcover. Condition: very good. no jacket. Like new.

paperback. Condition: Befriedigend. 756 Seiten; 9783540359043.4 Gewicht in Gramm: 2.

Hardcover. Condition: Sehr gut. Boston, Kluwer (2000). gr.8°. Some figs. XX, 652 p. Hardbound. Rudolf Ahlswede Symposium, University of Bielefeld, October 1998.- Further editors: N. Cai, G. Dueck, L. Khachatrian, M.S. Pinsker, A. Sarközy, I. Wegener, Z. Zhang.- Incl. bibliography of Rudolf Ahlswede.- In very good condition.…

Condition: As New. Unread book in perfect condition.

Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Condition: New.

Condition: New.

Hardback. Condition: Good. 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.…

Teubner, Stuttgart, 1993. 236 S., kart., (Einband etwas fleckig)---- Aus der Reihe: Leitfäden und Monographien der Informatik / Herausgegeben von unter anderem Prof. Dr. Hans-Jürgen Appelrath und Prof. Dr. Klaus Waldschmidt - 750 Gramm.

Condition: As New. Unread book in perfect condition.

Hardcover. XI, 457 p. Good condition. The pages are clean and without markings. Slight signs of storage and use. Retired library copy with corresponding markings. Otherwise, a neat copy. 9783519021070 Sprache: Englisch Gewicht in Gramm: 1000.

Hardback. Condition: Good. 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.…

Condition: New.

Condition: New.

Hardcover. Condition: Sehr gut. Bln., Springer (1996). 97 Abb. XX, 335 S. OPp. Sehr gut erhalten.

Paperback. Condition: Brand New. 210 pages. German language. 6.10x0.47x9.13 inches. In Stock.

Softcover. 261 S. Guter Zustand. Die Leseseiten sind sauber und ohne Markierungen. Leichte Lager- und Gebrauchsspuren. Ausgeschiedenes Bibliotheksexemplar mit entsprechender Kennzeichnung. Ansonsten ordentliches Exemplar. 9783519022763 Sprache: Deutsch Gewicht in Gramm: 1000.

Condition: New. pp. 322.

Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN:9783642077586.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results- such as the theory of NP-completeness- have influenced the development of all areas of computer science.The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.…

Condition: New.

Condition: New.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results- such as the theory of NP-completeness- have influenced the development of all areas of computer science.The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.…