Skip to main content

Focus areas

Artificial Intelligence

Quantum Computing

About

Artificial Intelligence

Quantum Computing

Focus areas
Blog
Publications
Careers
About

Publications

Home
Publications

Filter by

1 result at FOCS 2012

Hardness of finding independent sets in almost q-colorable graphs
- - Subhash Khot
  - Rishi Saket
- 2012
- FOCS 2012

Date

Start

End

Featured collections

Popular topics

Focus areas
Quick links
Work with us
- Careers
- Contact Research
Directories
Follow us

Contact IBM
Privacy
Terms of use
Accessibility