Edité par Birkhäuser (edition 1993), 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
EUR 7,46
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : As New. 1993. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.
Edité par Basel, Birkhäuser, ,, 1993
Vendeur : Antiquariat Gothow & Motzke, Berlin, Allemagne
EUR 24
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panier146 S./pp., Originalpappband (publisher's cardboard covers), (Progress in Theoretical Computer Science), Sprache: englisch.
Vendeur : Ammareal, Morangis, France
EUR 56,01
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Très bon. Ancien livre de bibliothèque avec équipements. Edition 1993. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1993. Ammareal gives back up to 15% of this item's net price to charity organizations.
Edité par Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : Literary Cat Books, Machynlleth, Powys, WALES, Royaume-Uni
Membre d'association : IOBA
Edition originale
EUR 51,32
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierOriginal Boards. Etat : New. Etat de la jaquette : No Dust Jacket. First Edition. In original shrinkwrap. ; Octavo; 155 pages.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 84,98
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Edité par Birkhäuser (edition 1993), 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
EUR 75,53
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : New. 1993. Brand new item, never opened! Ship within 24hrs. APO/FPO addresses supported.
Edité par Secaucus, New Jersey, U.S.A.: Birkhauser, 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : Bingo Books 2, Vancouver, WA, Etats-Unis
Edition originale
EUR 64,90
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Near Fine. 1st Edition. hardback book in near fine condition.
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
EUR 5,86
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Vendeur : Alien Bindings, BALTIMORE, MD, Etats-Unis
Edition originale
EUR 63,05
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : As New. No Jacket. First Edition. Hardcover Edition practically Brand New except for a small abrasion to the front flyeaf. The covers are in great shape. The binding is square and tight. The interior pages are clean and unmarked. The book will be carefully packaged for shipment for protection from the elements. USPS electronic tracking number issued free of charge.
Vendeur : moluna, Greven, Allemagne
EUR 92,27
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : moluna, Greven, Allemagne
EUR 92,27
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : New.
EUR 101,06
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 160.
EUR 102,48
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 160 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 106,27
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 160.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 119,28
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 119,28
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Edité par Birkhäuser Boston, Birkhäuser Boston Feb 1993, 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 106,99
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. Neuware -This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 160 pp. Englisch.
Edité par Birkhäuser Boston, Birkhäuser Boston Nov 2012, 2012
ISBN 10 : 1461267072 ISBN 13 : 9781461267072
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 106,99
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Neuware -This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 160 pp. Englisch.
Edité par Birkhäuser Boston, Birkhäuser Boston, 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 112,77
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.
Edité par Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10 : 1461267072 ISBN 13 : 9781461267072
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 112,77
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 136,85
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like New. book.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 104,61
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 104,96
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 167,39
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. Like New. book.
Edité par Birkhäuser Boston Nov 2012, 2012
ISBN 10 : 1461267072 ISBN 13 : 9781461267072
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 106,99
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain. 160 pp. Englisch.
Edité par Birkhäuser Boston Feb 1993, 1993
ISBN 10 : 0817636587 ISBN 13 : 9780817636586
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 106,99
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain. 160 pp. Englisch.
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 138,60
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 435.
Edité par Springer-Verlag New York Inc., 2012
ISBN 10 : 1461267072 ISBN 13 : 9781461267072
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 138,60
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 280.