2 papers across 2 sessions
We specify and analyze a simple probabilistic model to analyze the average-case complexitiy of deterministic game-solving algorithms, adressing limitations of previous independence-based models.