Tag Archives: Texas Holdem poker

Is Heads-Up Poker in P?

Posted on January 16, 2017 by Gil Kalai

Five years ago I wrote a post entitled Is Backgammon in P? It was based on conversations with Peter Bro Miltersen and Uri Zwick (shown together in the above picture) about the computational complexity of computing the values (and equilibrium … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Games | Tagged Kristoffer Arnsfelt Hansen, Poker, Rasmus Ibsen-Jensen, Stochastic games, Texas Holdem poker | 3 Comments

	Pewa on Answer: Lord Kelvin, The Age o…
	Gil Kalai on Answer: Lord Kelvin, The Age o…
	Pewa on Answer: Lord Kelvin, The Age o…
	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…

Tag Archives: Texas Holdem poker

Is Heads-Up Poker in P?

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives