skip to content
The probabilistic method Preview this item
ClosePreview this item
Checking...

The probabilistic method

Author: Noga Alon; Joel H Spencer
Publisher: Hoboken, N.J. : Wiley, ©2008.
Series: Wiley-Interscience series in discrete mathematics and optimization.
Edition/Format:   Print book : English : 3rd edView all editions and formats
Database:WorldCat
Summary:
The probabalistic method, allows us to prove the existence of combinatorial structure with certain properties by constructing an appropriate probability space and showing that a chosen element has the desired properties with positive probability.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Noga Alon; Joel H Spencer
ISBN: 9780470170205 0470170204
OCLC Number: 173809124
Notes: Dedication. Preface. Acknowledgments. PART I. METHODS.1. The Basic Method.1.1 The Probabilistic Method.1.2 Graph Theory.1.3 Combinatorics.1.4 Combinatorial Number Theory.1.5 Disjoint Pairs.1.6 Exercises. The Probabilistic Lens: The Erd" osKoRado Theorem.2. Linearity of Expectation.2.1 Basics.2.2 Splitting Graphs.2.3 Two Quickies.2.4 Balancing Vectors.2.5 Unbalancing Lights.2.6 Without Coin Flips.2.7 Exercises. The Probabilistic Lens: Bregman's Theorem.3. Alterations.3.1 Ramsey Numbers.3.2 Independent Sets.3.3 Combinatorial Geometry.3.4 Packing.3.5 Recoloring.3.6 Continuous Time.3.7 Exercises. The Probabilistic Lens: High Girth and High Chromatic Number.4. The Second Moment.4.1 Basics.4.2 Number Theory.4.3 More Basics.4.4 Random Graphs.4.5 Clique Number.4.6 Distinct Sums.4.7 The Rodl Nibble.4.8 Exercises. The Probabilistic Lens: Hamiltonian Paths.5. The Local Lemma.5.1 The Lemma.5.2 Property B and Multicolored Sets of Real Numbers.5.3 Lower Bounds for Ramsey Numbers.5.4 A Geometric Result.5.5 The Linear Arboricity of Graphs.5.6 Latin Transversals.5.7 The Algorithmic Aspect.5.8 Exercises. The Probabilistic Lens: Directed Cycles.6. Correlation Inequalities.6.1 The Four Functions Theorem of Ahlswede.and Daykin.6.2 The FKG Inequality.6.3 Monotone Properties.6.4 Linear Extensions of Partially Ordered Sets.6.5 Exercises. The Probabilistic Lens: Turan's Theorem.7. Martingales and Tight Concentration.7.1 Definitions.7.2 Large Deviations.7.3 Chromatic Number.7.4 Two General Settings.7.5 Four Illustrations.7.6 Talagrand's Inequality.7.7 Applications of Talagrand's Inequality.7.8 KimVu.7.9 Exercises. The Probabilistic Lens: Weierstrass Approximation Theorem.8. The Poisson Paradigm.8.1 The Janson Inequalities.8.2 The Proofs.8.3 Brun's Sieve.8.4 Large Deviations.8.5 Counting Extensions.8.6 Counting Representations.8.7 Further Inequalities.8.8 Exercises. The Probabilistic Lens: Local Coloring.9. Pseudorandomness.9.1 The Quadratic Residue Tournaments.9.2 Eigenvalues and Expanders.9.3 Quasi Random Graphs.9.4 Exercises. The Probabilistic Lens: Random Walks. PART II. TOPICS.10 Random Graphs.10.1 Subgraphs.10.2 Clique Number.10.3 Chromatic Number.10.4 ZeroOne Laws.10.5 Exercises. The Probabilistic Lens: Counting Subgraphs.11. The Erd" osR.'enyi Phase Transition.11.1 An Overview.11.2 Three Processes.11.3 The GaltonWatson Branching Process.11.4 Analysis of the Poisson Branching Process.11.5 The Graph Branching Model.11.6 The Graph and Poisson Processes Compared.11.7 The Parametrization Explained.11.8 The Subcritical Regions.11.9 The Supercritical Regimes.11.10 The Critical Window.11.11 Analogies to Classical Percolation Theory.11.12 Exercises. The Probabilistic Lens: The Rich Get Richer.12. Circuit Complexity.12.1 Preliminaries 318.12.2 Random Restrictions and BoundedDepth Circuits.12.3 More on BoundedDepth Circuits.12.4 Monotone Circuits.12.5 Formulae.12.6 Exercises. The Probabilistic Lens: Maximal Antichains.13. Discrepancy.13.1 Basics.13.2 Six Standard Deviations Suffice.13.3 Linear and Hereditary Discrepancy.13.4 Lower Bounds.13.5 The BeckFiala Theorem.13.6 Exercises. The Probabilistic Lens: Unbalancing Lights.14. Geometry.14.1 The Greatest Angle among Points in Euclidean Spaces.14.2 Empty Triangles Determined by Points in the Plane.14.3 Geometrical Realizations of Sign Matrices.14.4 QNets and VCDimensions of Range Spaces.14.5 Dual Shatter Functions and Discrepancy.14.6 Exercises. The Probabilistic Lens: Efficient Packing.15. Codes, Games and Entropy.15.1 Codes.15.2 Liar Game.15.3 Tenure Game.15.4 Balancing Vector Game.15.5 Nonadaptive Algorithms.15.6 Half Liar Game.15.7 Entropy.15.8 Exercises. The Probabilistic Lens: An Extremal Graph.16. Derandomization.16.1 The Method of Conditional Probabilities.16.2 dWise Independent Random Variables in Small Sample Spaces.16.3 Exercises. The Probabilistic Lens: Crossing Numbers, Incidences, Sums and Products.17. Graph Property Testing.17.1 Property Testing.17.2 Testing colorability.17.3 Szemer 'edi's Regularity Lemma.17.4 Testing trianglefreeness.17.5 Characterizing the testable graph properties.17.6 Exercises. The Probabilistic Lens: Tur?an Numbers and Dependent Random Choice. Appendix A: Bounding of Large Deviations. A.1 Chernoff Bounds. A.2 Lower Bounds. A.3 Exercises. The Probabilistic Lens: Trianglefree Graphs Have Large Independence Numbers. Appendix B: Paul Erd" os. B.1 Papers. B.2 Conjectures. B.3 On Erd" os. B.4 Uncle Paul. References. Subject Index. Author Index.
Description: xv, 352 p. : ill. ; 25 cm.
Contents: Dedication --
Preface --
Acknowledgments --
PART I. METHODS --
1. The Basic Method --
1.1 The Probabilistic Method --
1.2 Graph Theory --
1.3 Combinatorics --
1.4 Combinatorial Number Theory --
1.5 Disjoint Pairs --
1.6 Exercises --
The Probabilistic Lens: The Erdös-Ko-Rado Theorem --
2. Linearity of Expectation --
2.1 Basics --
2.2 Splitting Graphs --
2.3 Two Quickies --
2.4 Balancing Vectors --
2.5 Unbalancing Lights --
2.6 Without Coin Flips --
2.7 Exercises --
The Probabilistic Lens: Brégman's Theorem --
3. Alterations --
3.1 Ramsey Numbers --
3.2 Independent Sets --
3.3 Combinatorial Geometry --
3.4 Packing --
3.5 Recoloring --
3.6 Continuous Time --
3.7 Exercises --
The Probabilistic Lens: High Girth and High Chromatic Number --
4. The Second Moment --
4.1 Basics --
4.2 Number Theory --
4.3 More Basics --
4.4 Random Graphs --
4.5 Clique Number --
4.6 Distinct Sums --
4.7 The Rödl Nibble --
4.8 Exercises --
The Probabilistic Lens: Hamiltonian Paths --
5. The Local Lemma --
5.1 The Lemma --
5.2 Property B and Multicolored Sets of Real Numbers --
5.3 Lower Bounds for Ramsey Numbers --
5.4 A Geometric Result --
5.5 The Linear Arboricity of Graphs --
5.6 Latin Transversals --
5.7 The Algorithmic Aspect --
5.8 Exercises --
The Probabilistic Lens: Directed Cycles --
6. Correlation Inequalities --
6.1 The Four Functions Theorem of Ahlswede and Daykin --
6.2 The FKG Inequality --
6.3 Monotone Properties --
6.4 Linear Extensions of Partially Ordered Sets --
6.5 Exercises --
The Probabilistic Lens: Turan's Theorem --
7. Martingales and Tight Concentration --
7.1 Definitions --
7.2 Large Deviations --
7.3 Chromatic Number --
7.4 Two General Settings --
7.5 Four Illustrations --
7.6 Talagrand's Inequality --
7.7 Applications of Talagrand's Inequality --
7.8 Kim-Vu Polynomial Concentration --
7.9 Exercises --
The Probabilistic Lens: Weierstrass Approximation Theorem --
8. The Poisson Paradigm --
8.1 The Janson Inequalities --
8.2 The Proofs --
8.3 Brun's Sieve --
8.4 Large Deviations --
8.5 Counting Extensions --
8.6 Counting Representations --
8.7 Further Inequalities --
8.8 Exercises --
The Probabilistic Lens: Local Coloring --
9. Pseudorandomness --
9.1 The Quadratic Residue Tournaments --
9.2 Eigenvalues and Expanders --
9.3 Quasi Random Graphs --
9.4 Exercises --
The Probabilistic Lens: Random Walks --
PART II. TOPICS --
10 Random Graphs --
10.1 Subgraphs --
10.2 Clique Number --
10.3 Chromatic Number --
10.4 Zero One Laws --
10.5 Exercises --
The Probabilistic Lens: Counting Subgraphs --11. The Erdös-Rényi Phase Transition --11.1 An Overview --
11.2 Three Processes --11.3 The Galton-Watson Branching Process --11.4 Analysis of the Poisson Branching Process --
11.5 The Graph Branching Model --11.6 The Graph and Poisson Processes Compared --11.7 The Parametrization Explained --
11.8 The Subcritical Regions --11.9 The Supercritical Regimes --
11.10 The Critical Window --
11.11 Analogies to Classical Percolation Theory --
11.12 Exercises --
The Probabilistic Lens: The Rich Get Richer --
12. Circuit Complexity --
12.1 Preliminaries --
12.2 Random Restrictions and Bounded Depth Circuits --
12.3 More on Bounded Depth Circuits --12.4 Monotone Circuits --12.5 Formulae --12.6 Exercises --
The Probabilistic Lens: Maximal Antichains --
13. Discrepancy --
13.1 Basics --
13.2 Six Standard Deviations Suffice --
13.3 Linear and Hereditary Discrepancy --
13.4 Lower Bounds --
13.5 The Beck-Fiala Theorem --
13.6 Exercises --
The Probabilistic Lens: Unbalancing Lights --14. Geometry --
14.1 The Greatest Angle among Points in Euclidean Spaces --14.2 Empty Triangles Determined by Points in the Plane --14.3 Geometrical Realizations of Sign Matrices --
14.4 QNets and VC-Dimensions of Range Spaces --
14.5 Dual Shatter Functions and Discrepancy --
14.6 Exercises --
The Probabilistic Lens: Efficient Packing --
15. Codes, Games and Entropy --
15.1 Codes --
15.2 Liar Game --
15.3 Tenure Game --
15.4 Balancing Vector Game --
15.5 Nonadaptive Algorithms --
15.6 Half Liar Game --
15.7 Entropy --15.8 Exercises --
The Probabilistic Lens: An Extremal Graph --16. Derandomization --16.1 The Method of Conditional Probabilities --16.2 d-Wise Independent Random Variables in Small Sample Spaces --16.3 Exercises --
The Probabilistic Lens: Crossing Numbers, Incidences, Sums and Products --17. Graph Property Testing --17.1 Property Testing --17.2 Testing colorability --17.3 Szemerédi's Regularity Lemma --17.4 Testing Triangle-Freeness --17.5 Characterizing the testable graph properties --17.6 Exercises --
The Probabilistic Lens: Turán Numbers and Dependent Random Choice --
Appendix A: Bounding of Large Deviations --
A.1 Chernoff Bounds --
A.2 Lower Bounds --
A.3 Exercises --
The Probabilistic Lens: Trianglefree Graphs Have Large Independence Numbers --
Appendix B: Paul Erdös --
B.1 Papers --
B.2 Conjectures --
B.3 On Erdös --
B.4 Uncle Paul --
References --
Subject Index --
Author Index.
Series Title: Wiley-Interscience series in discrete mathematics and optimization.
Responsibility: Noga Alon, Joel H. Spencer.
More information:

Abstract:

Praise for the Second Edition : "Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety. the book may also be enjoyed on a lighter level since the  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/173809124> # The probabilistic method
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "173809124" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/11262031#Place/hoboken_n_j> ; # Hoboken, N.J.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/wahrscheinlichkeitsrechnung> ; # Wahrscheinlichkeitsrechnung
    schema:about <http://id.worldcat.org/fast/868961> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/kombinatorische_wahrscheinlichkeitstheorie> ; # Kombinatorische Wahrscheinlichkeitstheorie
    schema:about <http://id.worldcat.org/fast/1077737> ; # Probabilities
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/kombinatorische_analysis> ; # Kombinatorische Analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/probabilities> ; # Probabilities
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/wahrscheinlichkeit> ; # Wahrscheinlichkeit
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/combinatorial_analysis> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/sannolikhet> ; # Sannolikhet
    schema:about <http://experiment.worldcat.org/entity/work/data/11262031#Topic/kombinatorik> ; # Kombinatorik
    schema:about <http://dewey.info/class/511.6/e22/> ;
    schema:bookEdition "3rd ed." ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/18403230> ; # Joel H. Spencer
    schema:copyrightYear "2008" ;
    schema:creator <http://viaf.org/viaf/2603775> ; # Noga Alon
    schema:datePublished "2008" ;
    schema:description "Dedication -- Preface -- Acknowledgments -- PART I. METHODS -- 1. The Basic Method -- 1.1 The Probabilistic Method -- 1.2 Graph Theory -- 1.3 Combinatorics -- 1.4 Combinatorial Number Theory -- 1.5 Disjoint Pairs -- 1.6 Exercises -- The Probabilistic Lens: The Erdös-Ko-Rado Theorem -- 2. Linearity of Expectation -- 2.1 Basics -- 2.2 Splitting Graphs -- 2.3 Two Quickies -- 2.4 Balancing Vectors -- 2.5 Unbalancing Lights -- 2.6 Without Coin Flips -- 2.7 Exercises -- The Probabilistic Lens: Brégman's Theorem -- 3. Alterations -- 3.1 Ramsey Numbers -- 3.2 Independent Sets -- 3.3 Combinatorial Geometry -- 3.4 Packing -- 3.5 Recoloring -- 3.6 Continuous Time -- 3.7 Exercises -- The Probabilistic Lens: High Girth and High Chromatic Number -- 4. The Second Moment -- 4.1 Basics -- 4.2 Number Theory -- 4.3 More Basics -- 4.4 Random Graphs -- 4.5 Clique Number -- 4.6 Distinct Sums -- 4.7 The Rödl Nibble -- 4.8 Exercises -- The Probabilistic Lens: Hamiltonian Paths -- 5. The Local Lemma -- 5.1 The Lemma -- 5.2 Property B and Multicolored Sets of Real Numbers -- 5.3 Lower Bounds for Ramsey Numbers -- 5.4 A Geometric Result -- 5.5 The Linear Arboricity of Graphs -- 5.6 Latin Transversals -- 5.7 The Algorithmic Aspect -- 5.8 Exercises -- The Probabilistic Lens: Directed Cycles -- 6. Correlation Inequalities -- 6.1 The Four Functions Theorem of Ahlswede and Daykin -- 6.2 The FKG Inequality -- 6.3 Monotone Properties -- 6.4 Linear Extensions of Partially Ordered Sets -- 6.5 Exercises -- The Probabilistic Lens: Turan's Theorem -- 7. Martingales and Tight Concentration -- 7.1 Definitions -- 7.2 Large Deviations -- 7.3 Chromatic Number -- 7.4 Two General Settings -- 7.5 Four Illustrations -- 7.6 Talagrand's Inequality -- 7.7 Applications of Talagrand's Inequality -- 7.8 Kim-Vu Polynomial Concentration -- 7.9 Exercises -- The Probabilistic Lens: Weierstrass Approximation Theorem -- 8. The Poisson Paradigm -- 8.1 The Janson Inequalities -- 8.2 The Proofs -- 8.3 Brun's Sieve -- 8.4 Large Deviations -- 8.5 Counting Extensions -- 8.6 Counting Representations -- 8.7 Further Inequalities -- 8.8 Exercises -- The Probabilistic Lens: Local Coloring -- 9. Pseudorandomness -- 9.1 The Quadratic Residue Tournaments -- 9.2 Eigenvalues and Expanders -- 9.3 Quasi Random Graphs -- 9.4 Exercises -- The Probabilistic Lens: Random Walks -- PART II. TOPICS -- 10 Random Graphs -- 10.1 Subgraphs -- 10.2 Clique Number -- 10.3 Chromatic Number -- 10.4 Zero One Laws -- 10.5 Exercises -- The Probabilistic Lens: Counting Subgraphs --11. The Erdös-Rényi Phase Transition --11.1 An Overview -- 11.2 Three Processes --11.3 The Galton-Watson Branching Process --11.4 Analysis of the Poisson Branching Process -- 11.5 The Graph Branching Model --11.6 The Graph and Poisson Processes Compared --11.7 The Parametrization Explained -- 11.8 The Subcritical Regions --11.9 The Supercritical Regimes -- 11.10 The Critical Window -- 11.11 Analogies to Classical Percolation Theory -- 11.12 Exercises -- The Probabilistic Lens: The Rich Get Richer -- 12. Circuit Complexity -- 12.1 Preliminaries -- 12.2 Random Restrictions and Bounded Depth Circuits -- 12.3 More on Bounded Depth Circuits --12.4 Monotone Circuits --12.5 Formulae --12.6 Exercises -- The Probabilistic Lens: Maximal Antichains -- 13. Discrepancy -- 13.1 Basics -- 13.2 Six Standard Deviations Suffice -- 13.3 Linear and Hereditary Discrepancy -- 13.4 Lower Bounds -- 13.5 The Beck-Fiala Theorem -- 13.6 Exercises -- The Probabilistic Lens: Unbalancing Lights --14. Geometry -- 14.1 The Greatest Angle among Points in Euclidean Spaces --14.2 Empty Triangles Determined by Points in the Plane --14.3 Geometrical Realizations of Sign Matrices -- 14.4 QNets and VC-Dimensions of Range Spaces -- 14.5 Dual Shatter Functions and Discrepancy -- 14.6 Exercises -- The Probabilistic Lens: Efficient Packing -- 15. Codes, Games and Entropy -- 15.1 Codes -- 15.2 Liar Game -- 15.3 Tenure Game -- 15.4 Balancing Vector Game -- 15.5 Nonadaptive Algorithms -- 15.6 Half Liar Game -- 15.7 Entropy --15.8 Exercises -- The Probabilistic Lens: An Extremal Graph --16. Derandomization --16.1 The Method of Conditional Probabilities --16.2 d-Wise Independent Random Variables in Small Sample Spaces --16.3 Exercises -- The Probabilistic Lens: Crossing Numbers, Incidences, Sums and Products --17. Graph Property Testing --17.1 Property Testing --17.2 Testing colorability --17.3 Szemerédi's Regularity Lemma --17.4 Testing Triangle-Freeness --17.5 Characterizing the testable graph properties --17.6 Exercises -- The Probabilistic Lens: Turán Numbers and Dependent Random Choice -- Appendix A: Bounding of Large Deviations -- A.1 Chernoff Bounds -- A.2 Lower Bounds -- A.3 Exercises -- The Probabilistic Lens: Trianglefree Graphs Have Large Independence Numbers -- Appendix B: Paul Erdös -- B.1 Papers -- B.2 Conjectures -- B.3 On Erdös -- B.4 Uncle Paul -- References -- Subject Index -- Author Index."@en ;
    schema:description "The probabalistic method, allows us to prove the existence of combinatorial structure with certain properties by constructing an appropriate probability space and showing that a chosen element has the desired properties with positive probability."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/11262031> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/11262031#Series/wiley_interscience_series_in_discrete_mathematics_and_optimization> ; # Wiley-Interscience series in discrete mathematics and optimization.
    schema:name "The probabilistic method"@en ;
    schema:numberOfPages "352" ;
    schema:productID "173809124" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/173809124#PublicationEvent/hoboken_n_j_wiley_c2008> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/11262031#Agent/wiley> ; # Wiley
    schema:url <http://catdir.loc.gov/catdir/enhancements/fy0827/2007041609-t.html> ;
    schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017105401&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
    schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017105401&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
    schema:url <http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=3302313&custom_att_2=simple_viewer> ;
    schema:url <http://swbplus.bsz-bw.de/bsz28618253xcov.htm> ;
    schema:url <http://www.gbv.de/dms/ilmenau/toc/546359558.PDF> ;
    schema:url <http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=3302312> ;
    schema:workExample <http://worldcat.org/isbn/9780470170205> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA817707> ;
    umbel:isLike <http://d-nb.info/987564404> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/173809124> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/11262031#Place/hoboken_n_j> # Hoboken, N.J.
    a schema:Place ;
    schema:name "Hoboken, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/11262031#Series/wiley_interscience_series_in_discrete_mathematics_and_optimization> # Wiley-Interscience series in discrete mathematics and optimization.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/173809124> ; # The probabilistic method
    schema:name "Wiley-Interscience series in discrete mathematics and optimization." ;
    schema:name "Wiley-Interscience series in discrete mathematics and optimization" ;
    .

<http://experiment.worldcat.org/entity/work/data/11262031#Topic/combinatorial_analysis> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/11262031#Topic/kombinatorische_analysis> # Kombinatorische Analysis
    a schema:Intangible ;
    schema:name "Kombinatorische Analysis"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/11262031#Topic/kombinatorische_wahrscheinlichkeitstheorie> # Kombinatorische Wahrscheinlichkeitstheorie
    a schema:Intangible ;
    schema:name "Kombinatorische Wahrscheinlichkeitstheorie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/11262031#Topic/wahrscheinlichkeit> # Wahrscheinlichkeit
    a schema:Intangible ;
    schema:name "Wahrscheinlichkeit"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/11262031#Topic/wahrscheinlichkeitsrechnung> # Wahrscheinlichkeitsrechnung
    a schema:Intangible ;
    schema:name "Wahrscheinlichkeitsrechnung"@en ;
    .

<http://id.worldcat.org/fast/1077737> # Probabilities
    a schema:Intangible ;
    schema:name "Probabilities"@en ;
    .

<http://id.worldcat.org/fast/868961> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://viaf.org/viaf/18403230> # Joel H. Spencer
    a schema:Person ;
    schema:familyName "Spencer" ;
    schema:givenName "Joel H." ;
    schema:name "Joel H. Spencer" ;
    .

<http://viaf.org/viaf/2603775> # Noga Alon
    a schema:Person ;
    schema:familyName "Alon" ;
    schema:givenName "Noga" ;
    schema:name "Noga Alon" ;
    .

<http://worldcat.org/isbn/9780470170205>
    a schema:ProductModel ;
    schema:description "cloth : acid-free paper" ;
    schema:isbn "0470170204" ;
    schema:isbn "9780470170205" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.