From Erdős to algorithms

DOI10.1016/0012-365X(93)E0117-MzbMath0816.90150OpenAlexW2778477491MaRDI QIDQ1344623

J. H. Spencer

Publication date: 13 February 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0117-m

zbMATH Keywords

probabilistic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Game theory (91A99) 2-person games (91A05) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The complexity of explicit constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balancing vectors in the max norm
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• On 3-chromatic hypergraphs
• Six Standard Deviations Suffice
• On a combinatorial problem. II
• On a combinatorial game

This page was built for publication: From Erdős to algorithms