• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Probabilistic Methods for Algorithmic Discrete Mathematics

پدید آورنده
edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed.

موضوع
Algebra-- Data processing.,Combinatorics.,Computer science.,Distribution (Probability theory).,Mathematics.

رده

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
9783642084263
(Number (ISBN
9783662127889

NATIONAL BIBLIOGRAPHY NUMBER

Number
b407071

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Probabilistic Methods for Algorithmic Discrete Mathematics
General Material Designation
[Book]
First Statement of Responsibility
edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Berlin, Heidelberg :
Name of Publisher, Distributor, etc.
Imprint: Springer,
Date of Publication, Distribution, etc.
1998.

SERIES

Series Title
Algorithms and Combinatorics,
Volume Designation
16
ISSN of Series
0937-5511 ;

CONTENTS NOTE

Text of Note
The Probabilistic Method -- Probabilistic Analysis of Algorithms -- An Overview of Randomized Algorithms -- Mathematical Foundations of the Markov Chain Monte Carlo Method -- Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems -- Concentration -- Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms -- Author Index.
0

SUMMARY OR ABSTRACT

Text of Note
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

OTHER EDITION IN ANOTHER MEDIUM

International Standard Book Number
9783642084263

PIECE

Title
Springer eBooks

TOPICAL NAME USED AS SUBJECT

Algebra-- Data processing.
Combinatorics.
Computer science.
Distribution (Probability theory).
Mathematics.

PERSONAL NAME - PRIMARY RESPONSIBILITY

Habib, Michel.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

McDiarmid, Colin.
Ramirez-Alfonsin, Jorge.
Reed, Bruce.

CORPORATE BODY NAME - ALTERNATIVE RESPONSIBILITY

SpringerLink (Online service)

ORIGINATING SOURCE

Date of Transaction
20190307161100.0

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival