Randomization, derandomization and antirandomization: Three games
type: Item
instance of: scholarly article
title: Randomization, derandomization and antirandomization: Three games
zbMATH Open document ID: 0805.90121
DOI: 10.1016/0304-3975(94)90181-3
published in: Theoretical Computer Science
publication date: 1995-01-31T00:00:00Z
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 626287
author: Joel Spencer
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90181-3
OpenAlex ID: W2038872483
cites work: Q4004078
cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs
cites work: Six Standard Deviations Suffice
cites work: Ulam's searching game with a fixed number of lies
Recommended article: Derandomization in game-theoretic probability
Recommended article: Q2785563
Recommended article: Q4737216
Recommended article: Two methods of randomization in statistics and the theory of games
Recommended article: Q4472503
Recommended article: Derandomizing Arthur-Merlin games under uniform assumptions
Recommended article: Some results on derandomization
Recommended article: Q4418651
Recommended article: THE RANDOM FAIR GAMES PROBLEM
description: scientific article; zbMATH DE number 626287