Inevitable randomness in discrete mathematics

zbMATH Open1186.60001MaRDI QIDQ3397699FDOQ3397699

Authors: József Beck 

Publication date: 23 September 2009

Recommendations

• scientific article; zbMATH DE number 1195809
• Mathematics and computation. A theory revolutionizing technology and science
• The strange logic of random graphs
• scientific article; zbMATH DE number 1528185
• Randomness -- a computational complexity perspective

zbMATH Keywords

complexityrandomnessgraph games

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Irregularities of distribution, discrepancy (11K38)

Cited In (9)

• Randomness of the square root of 2 and the giant leap. II
• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
• Pell equation and randomness
• Mathematical metaphysics of randomness
• Economical extremal hypergraphs for the Erdős-Selfridge theorem
• Extremal hypergraphs for the Erdős-Selfridge theorem using labelings of binary trees
• Title not available (Why is that?)
• Strong games played on random graphs
• Title not available (Why is that?)

This page was built for publication: Inevitable randomness in discrete mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397699)