Fingerprint
Dive into the research topics of 'Hardness of finding independent sets in almost q-colorable graphs'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Hardness of finding independent sets in almost q-colorable graphs
Subhash Khot, Rishi Saket
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution