PubPeer
The online Journal club
login
create account
Home
Publications
A subexponential lower bound for the Random Facet algorithm for Parity Games
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011) -
Comments
doi: 10.1137/1.9781611973082.19
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Go to article
Go to preprint
Comments awaiting moderation ({{totalComments}})
Review last reports ({{totalReports}})
Review last email suggestions ({{totalPendingEmails}})
Last month's whitelisted comments ({{totalWhitelistedComments}})