Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
Random instances of a graph coloring problem are hard
Home
Publications
Random instances of a graph coloring problem are hard
Random instances of a graph coloring problem are hard
RV
Ramarathnam Venkatesan
Ramarathnam Venkatesan
LL
Leonid Levin
Leonid Levin
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
1 January 1988
proceedings article
Published by
Association for Computing Machinery (ACM)
p.
217-222
https://doi.org/10.1145/62212.62231
Abstract
No abstract available
Cited by 31 articles