Neuware -Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 348 pp. Englisch.

Bestandsnummer des Verk�ufers 9783540646228

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Probabilistic Methods for Algorithmic Discrete Mathematics
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1998
Erscheinungsjahr: 1998
Sprache: Englisch
ISBN-10: 3540646221
ISBN-13: 9783540646228
Einband: Buch
Zustand: Neu
Abmessungen: Breite: 241 mm, H�he: 160 mm, Tiefe: 24 mm
Gewicht: 688 Gramm

�ber diesen Titel

Inhaltsangabe

Leave nothing to chance. This cliche embodies the common belief that ran� domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba� bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus� sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech� niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.

Von der hinteren Coverseite

The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included:
- a simple treatment of Talagrand inequalities and their applications
- an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms
- a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods)
- a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph
- a succinct treatment of randomized algorithms and derandomization techniques

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Impressum Thorsten Retsch Buchversand Mimpf2000 Ober�lschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir f�hren gebrauchte B�cher aus allen Sparten der Literatur

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

buchversandmimpf2000
Germany

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Widerrufsbelehrung/ Muster-Widerrufsformular/
Allgemeine Gesch�ftsbedingungen und Kundeninformationen/ Datenschutzerkl�rung

Widerrufsrecht f�r Verbraucher
(Verbraucher ist jede nat�rliche Person, die ein Rechtsgesch�ft zu Zwecken abschlie�t, die �berwiegend weder ihrer gewerblichen noch ihrer selbstst�ndigen beruflichen T�tigkeit zugerechnet werden k�nnen.)

Widerrufsbelehrung

Widerrufsrecht
Sie haben das Recht, binnen 14 Tagen ohne Angabe von Gr�nden diesen Vertrag zu widerrufen.
Die Widerrufsfr...

Mehr Information

Widerrufsbelehrung

Versandbedingungen

Soweit in der Artikelbeschreibung keine andere Frist angegeben ist, erfolgt die Lieferung der Ware innerhalb von 3-5 Werktagen nach Vertragsschluss, bei Vorauszahlung erst nach Eingang des vollst�ndigen Kaufpreises und der Versandkosten. Alle Preise inkl. MwSt.

Versandkosten innerhalb von Deutschland

Versandkosten innerhalb von Deutschland
Bestellmenge	2 bis 7�Werktage	2 bis 6�Werktage
Erster Artikel	EUR 0.00	EUR 3.99

Die Versandzeiten werden von den Verk�uferinnen und Verk�ufern festgelegt. Sie variieren je nach Versanddienstleister und Standort. Sendungen, die den Zoll passieren, k�nnen Verz�gerungen unterliegen. Eventuell anfallende Abgaben oder Geb�hren sind von der K�uferin bzw. dem K�ufer zu tragen. Die Verk�uferin bzw. der Verk�ufer kann Sie bez�glich zus�tzlicher Versandkosten kontaktieren, um einen m�glichen Anstieg der Versandkosten f�r Ihre Artikel auszugleichen.

Impressum & Info zum Verk�ufer