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

	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…
	Seven Problems Aroun… on Optimal Colorful Tverberg…
	Gil Kalai on Chess can be a Game of Lu…
	月旦 XIV \| Fight with… on The Race to Quantum Technologi…
	Gil Kalai on Is Mathematics a Science?
	Ewa on When It Rains It Pours
	Gil Kalai on Two Math Riddles
	Brooke W on Two Math Riddles
	Gil Kalai on Oded Goldreich Fest
	Updates (belated) Be… on Exciting News on Three Dimensi…

Tag Archives: Texas Holdem poker

Is Heads-Up Poker in P?

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives