Counting sampling integrating algorithms von jerrum mark (3 Ergebnisse)
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 79,68
EUR 14,01 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.
- Softcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 127,68
EUR 9,08 VersandVersand innerhalb von USAAnzahl: 15 verfügbar
Zustand: New. Explores the idea of accumulating information about a set of combinatorial structures by performing a random walk on those structures. This work is not only suitable for teachers of postgraduate courses on these topics, but also for established researchers. Series: Lectures in Mathematics. ETH Zurich. Num Pages: 12…3 pages, 7 black & white illustrations, biography. BIC Classification: PBWH. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 254 x 178 x 6. Weight in Grams: 520. . 2003. 2003rd Edition. paperback. . . . . Books ship from the US and Ireland.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 80,24
EUR 61,29 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - These notes had their origin in a postgraduate lecture series I gave at the Eid genossiche Technische Hochschule (ETH) in Zurich in the Spring of 2000. I am very grateful to my hosts, the Forschungsinstitut fUr Mathematik at ETH, for providing the id…eal opportunity to develop and present this material in what I hope is a reasonably coherent manner, and also for encouraging and assisting me to record the proceedings in these lecture notes. The subject of the lecture series was counting (of combinatorial structures) and related topics, viewed from a computational perspective. As we shall see, 'related topics' include sampling combinatorial structures (being computationally equivalent to approximate counting via efficient reductions), evaluating partition functions (being weighted counting) and calculating the volume of bodies (being counting in the limit). We shall be inhabiting a different world to the one conjured up by books with titles like Combinatorial Enumeration or Graphical Enumeration. There, the prob lems are usually parameterised on a single integer parameter n, and the required solutions are closed form or asymptotic estimates obtained using very refined and precise analytical tools.
