Microsoft Research
Microsoft Translator |
Random Instances of a Graph Coloring Problem Are Hard

Ramarathnam Venkatesan and Leonid A. Levin
1988

In  STOC

Details

TypeInproceedings
Pages217-222
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > Random Instances of a Graph Coloring Problem Are Hard