Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ESA
2005
Springer

favoriteEmaildiscussreport

76views Algorithms» more ESA 2005»

The Complexity of Games on Highly Regular Graphs

13 years 10 months ago

The Complexity of Games on Highly Regular Graphs

Download www.cs.berkeley.edu

Konstantinos Daskalakis, Christos H. Papadimitriou

Real-time Traffic

ESA 2005 |

claim paper

Related Content

» The Complexity of PartialObservation Parity Games

» Games with Winning Conditions of High Borel Complexity

» BanachMazur Games on Graphs

» L2 norm regularized feature kernel regression for graph data

» A HighThroughput Programmable Decoder for LDPC Convolutional Codes

» The complexity of random ordered structures

» ISEGEN Generation of HighQuality Instruction Set Extensions by Iterative Improvement

» A Combinatorial Family of Near Regular LDPC Codes

» Binomial Graph A Scalable and FaultTolerant Logical Network Topology

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ESA
Authors	Konstantinos Daskalakis, Christos H. Papadimitriou

Comments (0)