Randomization, derandomization and antirandomization: Three games

DOI10.1016/0304-3975(94)90181-3zbMath0805.90121OpenAlexW2038872483MaRDI QIDQ1331937

J. H. Spencer

Publication date: 31 January 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90181-3

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (6)

Typical rounding problems ⋮ European tenure games ⋮ Game chromatic index of graphs with given restrictions on degrees ⋮ A new upper bound on the game chromatic index of graphs ⋮ Vector balancing games with aging ⋮ The Query Complexity of Finding a Hidden Permutation

Cites Work

• Unnamed Item
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Ulam's searching game with a fixed number of lies
• Six Standard Deviations Suffice

This page was built for publication: Randomization, derandomization and antirandomization: Three games