Colin McDiarmid – författare
Visar alla böcker från författaren Colin McDiarmid. Handla med fri frakt och snabb leverans.
8 produkter
Combinatorics, Complexity, and Chance
A Tribute to Dominic Welsh
Inbunden, 2007
2215 kr
Lägg i varukorg
Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation, and has taught, influenced and inspired generations of students and researchers in mathematics. This volume summarises and reviews the …
Random Graphs, Geometry and Asymptotic Structure
Av Michael Krivelevich, Konstantinos Panagiotou m. fl.
Inbunden, 2016
1139 kr
Lägg i varukorg
The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and …
Random Graphs, Geometry and Asymptotic Structure
Av Colin McDiarmid, Mathew Penrose m. fl.
E-bok, 2016
638 kr
Lägg i varukorg
The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and …
Random Graphs, Geometry and Asymptotic Structure
Av Colin McDiarmid, Mathew Penrose m. fl.
E-bok, 2016
652 kr
Lägg i varukorg
The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Michel Habib, Colin McDiarmid m. fl.
Inbunden, 1998
1095 kr
Lägg i varukorg
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 …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Michel Habib, Colin McDiarmid m. fl.
Häftad, 2010
1095 kr
Lägg i varukorg
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 …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Bruce Reed, Jorge Ramirez-Alfonsin m. fl.
E-bok, 2013
1459 kr
Lägg i varukorg
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 …
Random Graphs, Geometry and Asymptotic Structure
Av Michael Krivelevich, Konstantinos Panagiotou m. fl.
Häftad, 2016
537 kr
Tillfälligt slut
The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and …
